TOL systems and languages

DOI10.1016/S0019-9958(73)80004-XMaRDI QIDQ5180871zbMATH OpenOpenAlexFDO

Authors Grzegorz Rozenberg

Publication date 1973

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

Full work available at URL https://doi.org/10.1016/s0019-9958(73)80004-x

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(22)

• On TOL languages over terminals
• A limit theorem for set of subwords in deterministic TOL laguages
• The membership question for ETOL-languages is polynomially complete
• Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems
• A note on K-iteration grammars
• On the number of subwords of everywhere growing DTOL languages
• Context-free grammars with graph-controlled tables
• On slicing of K-iteration grammars
• TIL systems and languages
• Iterating iterated substitution
• Problèmes decidables concernant les TOL-langages unaires
• ETOL forms
• On the structure of derivations in deterministic ETOL systems
• Characterization of unary developmental languages
• DOL sequences
• L-systems in geometric modeling
• Fuzzy L-systems
• On formal descriptions for knitting recursive patterns
• Doubly deterministic tabled OL systems
• A note on Lindenmayer systems, Szilard languages, spectra, and equivalence
• scientific article; zbMATH DE number 3506192 (Why is no real title available?)
• Comparison of some descriptional complexities of 0L systems obtained by a unifying approach

This page was built for publication: TOL systems and languages

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