Decidability of structural equivalence of E0L grammars

DOI10.1016/0304-3975(91)90176-3zbMath0729.68039OpenAlexW2023379232MaRDI QIDQ807023

Kai Salomaa, Sheng Yu

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

zbMATH Keywords

structural equivalenceEOL grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (6)

The strong equivalence of ET0L grammars ⋮ Complexity of EOL structural equivalence ⋮ Complexity of E0L structural equivalence ⋮ Structural equivalence and ET0L grammars ⋮ Decidability of equivalence for deterministic synchronized tree automata ⋮ Decidability of EDT0L structural equivalence

Cites Work

• Defining families of trees with E0L grammars
• Bracketed context-free languages
• Structural equivalence of context-free grammars
• Parenthesis Grammars
• Indexed Grammars—An Extension of Context-Free Grammars
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decidability of structural equivalence of E0L grammars