Complexity of some problems concerningL systems
From MaRDI portal
Cites work
- A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages
- Complete problems for deterministic polynomial time
- General context-free recognition in less than cubic time
- scientific article; zbMATH DE number 3480114 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 3569826 (Why is no real title available?)
- scientific article; zbMATH DE number 3575000 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- Recognition and parsing of context-free languages in time n3
- Recognition of deterministic ETOL languages in logarithmic space
- The membership question for ETOL-languages is polynomially complete
- The tape-complexity of context-independent developmental languages
Cited in
(14)- Recurrent words and simultaneous growth in T0L systems
- Concerning two-adjacent context-free languages
- Decidability of the finiteness of ranges of tree transductions
- The Euclidean traveling salesman problem and a space-filling curve
- Extending regular expressions with homomorphic replacement
- Complexity of E0L structural equivalence
- Parallel recognition and ranking of context-free languages
- Parallel complexity of iterated morphisms and the arithmetic of small numbers
- Complexity of E0L structural equivalence
- Pumping lemmas can be ``harmful
- Structural equivalence and ET0L grammars
- Completeness results concerning systolic tree automata and E0L languages
- Decision problems concerning L systems
- Maximal universal width of an AFA is NP-hard
This page was built for publication: Complexity of some problems concerningL systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3896507)
