On 0L-Languages
From MaRDI portal
Publication:5653576
DOI10.1016/S0019-9958(71)90164-1zbMATH Open0242.68052MaRDI QIDQ5653576FDOQ5653576
Authors: P. G. Doucet, Grzegorz Rozenberg 
Publication date: 1971
Published in: Information and Control (Search for Journal in Brave)
Cited In (25)
- DOL sequences
- TIL systems and languages
- Development systems with finite axiom sets
- Extension of tabled 0L-systems and languages
- Classes of formal grammars
- Ambiguity in the developmental systems of Lindenmayer
- Some restrictions onW-grammars
- The unsolvability of the equality problem for sentential forms of context-free grammars
- Title not available (Why is that?)
- Algorithms for producing grammars from sample derivations: a common problem of formal language theory and developmental biology
- Direct proofs of the undecidability of the equivalence problem for sentential forms of linear context-free grammars and the equivalence problem for OL systems
- A note on Lindenmayer systems, Szilard languages, spectra, and equivalence
- Iterating iterated substitution
- Characterization of unary developmental languages
- On some families of languages related to developmental systems
- Parallel OL-languages
- Time-delayed OL languages and sequences
- On a family of acceptors for some classes of developmental languages
- Subword complexities of various classes of deterministic developmental languages without interactions
- Some properties of the class of \(L\) languages with interactions
- Description of developmental languages using recurrence systems
- Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems
- Context free languages in biological systems
- Development systems with locally catenative formulas
- Context-free grammars with selective rewriting
This page was built for publication: On 0L-Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5653576)
