A note on some systems of lindenmayer

DOI10.1007/BF01702868zbMath0218.02031OpenAlexW2001114061MaRDI QIDQ5622169

Dirk van Dalen

Publication date: 1971

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01702868

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Grammars and rewriting systems (68Q42) Recursively (computably) enumerable sets and degrees (03D25) Turing machines and related notions (03D10)

Related Items

Iterated sequential transducers as language generating devices ⋮ Models for cellular interactions in development without polarity of individual cells II. Problems of synchronization and regulation ⋮ Extension of tabled 0L-systems and languages ⋮ Periodicity in generations of automata ⋮ Subword complexities of various classes of deterministic developmental languages with interactions ⋮ Complete symmetry in d2l systems and cellular automata ⋮ On a family of acceptors for some classes of developmental languages ⋮ Development systems with finite axiom sets ⋮ Development systems with locally catenative formulas ⋮ The unsolvability of the equality problem for sentential forms of context-free grammars ⋮ Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems ⋮ Deterministic Lindenmayer languages, nonterminals and homomorphisms ⋮ TIL systems and languages ⋮ Classes of formal grammars ⋮ Algorithms for producing grammars from sample derivations: a common problem of formal language theory and developmental biology ⋮ Characterization of unary developmental languages ⋮ DOL sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• The theory of languages
• Classes of languages and linear-bounded automata