Complexity of E0L structural equivalence
From MaRDI portal
Publication:4359286
DOI10.1051/ita/1995290604711zbMath0881.68070MaRDI QIDQ4359286
Kai Salomaa, Sheng Yu, Derick Wood
Publication date: 8 October 1997
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92519
68Q45: Formal languages and automata
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decidability of structural equivalence of E0L grammars
- On the power of synchronization in parallel computations
- Defining families of trees with E0L grammars
- Communication for alternating machines
- The membership question for ETOL-languages is polynomially complete
- The tape-complexity of context-independent developmental languages
- Deterministic versus nondeterministic space in terms of synchronized alternating machines
- Structural equivalence of context-free grammars
- Deciding Equivalence of Finite Tree Automata
- Complexity of some problems concerningL systems
- Alternation
- Parenthesis Grammars