Iterating iterated substitution
From MaRDI portal
Publication:1241066
DOI10.1016/0304-3975(77)90043-3zbMath0364.68070MaRDI QIDQ1241066
Publication date: 1978
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://research.utwente.nl/en/publications/iterating-iterated-substitution(99ff8229-cf1e-4ff0-a286-97f47e267ea5).html
68Q45: Formal languages and automata
Related Items
Parallelism and synchronization in two-level metacontrolled substitution grammars, Fast deterministic parsers for transition networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity theory and the operational structure of algebraic programming systems
- Nonterminals, homomorphisms and codings in different variations of OL- systems. II: Nondeterministic systems
- Copying theorems
- A decomposition theorem for hyper-algebraic extensions of language families
- A relationship between ETOL and EDTOL languages
- On slicing of K-iteration grammars
- L systems
- Substitution in families of languages
- A characterization of context-free languages
- Substitution expressions
- A generalization of Parikh's semilinear theorem
- Extension of tabled 0L-systems and languages
- A note on Lindenmayer systems, Szilard languages, spectra, and equivalence
- Description of developmental languages using recurrence systems
- The equality of EOL languages and codings of ol languages
- Decomposition Theorems for Various Kinds of Languages Parallel in Nature
- Closure properties of some families of languages associated with biological systems
- TOL systems and languages
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Full AFLs and nested iterated substitution
- A modification of a substitution theorem and some necessary and sufficient conditions for sets to be context-free
- Cap expressions for context-free languages
- On 0L-Languages
