scientific article; zbMATH DE number 3550202

zbMath0353.68087MaRDI QIDQ4124350

Aristid Lindenmayer, Grzegorz Rozenberg

Publication date: 1972

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (20)

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

This page was built for publication: