"Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete."

Petr Jancar, Sylvain Schmitz (2019)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2019-02-01

a service of  Schloss Dagstuhl - Leibniz Center for Informatics