Deterministic Lindenmayer languages, nonterminals and homomorphisms

DOI10.1016/0304-3975(76)90006-2zbMath0332.68050OpenAlexW2133947396MaRDI QIDQ1228208

Paul M. B. Vitányi

Publication date: 1976

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/312

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Complete symmetry in d2l systems and cellular automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some properties of the class of \(L\) languages with interactions
• Nonterminals, homomorphisms and codings in different variations of OL- systems. I: Deterministic systems
• On sentential forms of context-free grammars
• An 8-state minimal time solution to the firing squad synchronization problem
• Synchronization of growing cellular arrays
• Description of developmental languages using recurrence systems
• The equality of EOL languages and codings of ol languages
• Words in the History of a Turing Machine with a Fixed Input
• A note on some systems of lindenmayer