Structural equivalence and ET0L grammars
From MaRDI portal
Publication:671426
DOI10.1016/0304-3975(95)00187-5zbMath0871.68119MaRDI QIDQ671426
Kai Salomaa, Sheng Yu, Derick Wood
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)00187-5
68Q42: Grammars and rewriting systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decidability of structural equivalence of E0L grammars
- Defining families of trees with E0L grammars
- Computer science today. Recent trends and developments
- Bracketed context-free languages
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
- Structural equivalence of context-free grammars
- Complexity of some problems concerningL systems
- Complexity of E0L structural equivalence
- One-sided and two-sided context in formal grammars
- Parenthesis Grammars