On 0L-Languages

From MaRDI portal
Publication:5653576

DOI10.1016/S0019-9958(71)90164-1zbMath0242.68052MaRDI QIDQ5653576

P. G. Doucet, Grzegorz Rozenberg

Publication date: 1971

Published in: Information and Control (Search for Journal in Brave)




Related Items (25)

Unnamed ItemContext-free grammars with selective rewritingExtension of tabled 0L-systems and languagesOn some families of languages related to developmental systemsA note on Lindenmayer systems, Szilard languages, spectra, and equivalenceContext free languages in biological systemsDescription of developmental languages using recurrence systemsOn a family of acceptors for some classes of developmental languagesDevelopment systems with finite axiom setsParallel OL-languagesDevelopment systems with locally catenative formulasThe unsolvability of the equality problem for sentential forms of context-free grammarsNonterminals versus homomorphisms in defining languages for some classes of rewriting systemsAmbiguity in the developmental systems of LindenmayerSubword complexities of various classes of deterministic developmental languages without interactionsTime-delayed OL languages and sequencesSome properties of the class of \(L\) languages with interactionsTIL systems and languagesIterating iterated substitutionClasses of formal grammarsDirect proofs of the undecidability of the equivalence problem for sentential forms of linear context-free grammars and the equivalence problem for OL systemsAlgorithms for producing grammars from sample derivations: a common problem of formal language theory and developmental biologyCharacterization of unary developmental languagesDOL sequencesSome restrictions onW-grammars




This page was built for publication: On 0L-Languages