Complexity of E0L structural equivalence
From MaRDI portal
Publication:4359286
DOI10.1051/ITA/1995290604711zbMATH Open0881.68070OpenAlexW6508898MaRDI QIDQ4359286FDOQ4359286
D. Wood, Sheng Yu, Kai Salomaa
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deciding Equivalence of Finite Tree Automata
- Alternation
- Defining families of trees with E0L grammars
- Structural equivalence of context-free grammars
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parenthesis Grammars
- Decidability of structural equivalence of E0L grammars
- Title not available (Why is that?)
- Deterministic versus nondeterministic space in terms of synchronized alternating machines
- On the power of synchronization in parallel computations
- Complexity of some problems concerningL systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The membership question for ETOL-languages is polynomially complete
- Title not available (Why is that?)
- Title not available (Why is that?)
- The tape-complexity of context-independent developmental languages
- Communication for alternating machines
Cited In (6)
This page was built for publication: Complexity of E0L structural equivalence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4359286)
