Decidability of structural equivalence of E0L grammars
From MaRDI portal
Publication:807023
DOI10.1016/0304-3975(91)90176-3zbMath0729.68039MaRDI QIDQ807023
Publication date: 1991
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(91)90176-3
68Q42: Grammars and rewriting systems
Related Items
Complexity of E0L structural equivalence, Structural equivalence and ET0L grammars, Decidability of equivalence for deterministic synchronized tree automata, Decidability of EDT0L structural equivalence