scientific article; zbMATH DE number 3550202

zbMATH Open0353.68087MaRDI QIDQ4124350FDOQ4124350

Authors: Aristid Lindenmayer, Grzegorz Rozenberg 

Publication date: 1972

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (20)

• DOL sequences
• EOL languages are not codings of FPOL languages
• Étude syntaxique de certains langages solutions d'équations avec opérateurs
• The equivalence problem for deterministic TOL-systems is undecidable
• Subword complexities of various classes of deterministic developmental languages with interactions
• Direct proofs of the undecidability of the equivalence problem for sentential forms of linear context-free grammars and the equivalence problem for OL systems
• Algorithmic height compression of unordered trees
• A note on Lindenmayer systems, Szilard languages, spectra, and equivalence
• Characterization of unary developmental languages
• On proving that certain languages are not ETOL
• On a family of acceptors for some classes of developmental languages
• The length sets of D0L languages are uniformly bounded
• Subword complexities of various classes of deterministic developmental languages without interactions
• The equality of EOL languages and codings of ol languages
• A limit theorem for set of subwords in deterministic TOL laguages
• Description of developmental languages using recurrence systems
• Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems
• Survey of research in the theory of homogeneous structures and their applications
• On the number of subwords of everywhere growing DTOL languages
• The tape-complexity of context-independent developmental languages

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4124350)