A note on Lindenmayer systems, Szilard languages, spectra, and equivalence
From MaRDI portal
Publication:4058153
DOI10.1007/BF00976218zbMath0303.68050OpenAlexW1971014354MaRDI QIDQ4058153
Publication date: 1975
Published in: International Journal of Computer and Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00976218
Related Items
Abstract grammars based on transductions, Defining families of trees with E0L grammars, Parallel/sequential rectangular arrays with tables, A note on K-iteration grammars, A decomposition theorem for hyper-algebraic extensions of language families, Iterating iterated substitution, Hierarchies of hyper-AFLs
Cites Work
- Unnamed Item
- Unnamed Item
- Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems
- Extension of tabled 0L-systems and languages
- The equality of EOL languages and codings of ol languages
- Generative Models for Parallel Processes
- TOL systems and languages
- Integral sequential word functions and growth equivalence of lindenmayer systems
- Indexed Grammars—An Extension of Context-Free Grammars
- On 0L-Languages
- A biologically motivated extension of ALGOL-like languages