Description of developmental languages using recurrence systems
From MaRDI portal
Publication:4072878
DOI10.1007/BF01780579zbMath0313.68068OpenAlexW1994299651MaRDI QIDQ4072878
Aristid Lindenmayer, Gabor T. Herman, Grzegorz Rozenberg
Publication date: 1975
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01780579
Related Items
Context dependent table matrix L systems, A language to describe the growth of neurites, Concerning two-adjacent context-free languages, On generalized DT0L systems and their fixed points, On developmental systems: Multilevel and parallel development, A polynomial algorithm for deciding bisimilarity of normed context-free processes, Slender 0L languages, Iterated sequential transducers as language generating devices, Interactive L systems with a fast local growth, Regeneration in 1L systems, On commutative DTOL systems, On the degree of synchronization of k1TOL and k1ETOL systems, On the splicing operation, The Euclidean traveling salesman problem and a space-filling curve, On recursion in ETOL systems, On ETOL systems with rank, Codeterministic Lindenmayer schemes and systems, An approach to a unified theory of grammar and L forms, Persistent ETOL systems, L-system specification of knot-insertion rules for non-uniform B-spline subdivision, Programmed OL-systems, A-transducers and the monotonicity of IL schemes, On DIL schemes simulated by DOL schemes, Extension of tabled 0L-systems and languages, A model for developmental systems. I: Generating word without any operating system, An automaton generating series of graphs, Grammars with valuations - a discrete model for self-organization of biopolymers, The decidability of the DOL-DTOL equivalence problem, (g//0,g//1,\dots ,g//k)-trees and unary OL systems, The copying power of one-state tree transducers, On the generative capacity of compound string and array grammars, DOL schemes and the periodicity of string embeddings, Machine characterization of (E0L-E0L) array languages, Computer simulation of bidimensional growth of the gametophyte of \(Anemia\) \(phyllitidis\) (L.) Sw, Quasi-deterministic 0L systems and their representation, Dynamical properties of PWD0L systems, Completeness results concerning systolic tree automata and E0L languages, PARALLEL GRAPH GENERATING AND GRAPH RECURRENCE SYSTEMS FOR MULTICELLULAR DEVELOPMENT†, Upper bounds on recognition of a hierarchy of non-context-free languages, On the union of 0L languages, A Note on Parallel Splicing on Images, The membership question for ETOL-languages is polynomially complete, Three results of comparison between L languages with and without interaction, Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems, Ambiguity in the developmental systems of Lindenmayer, Subword complexities of various classes of deterministic developmental languages without interactions, Time-delayed OL languages and sequences, Copying theorems, A decomposition theorem for hyper-algebraic extensions of language families, Fuzzy \(L\) languages, Two theorems concerning recognizable \(N\)-subsets of \(\sigma^*\), Deterministic Lindenmayer languages, nonterminals and homomorphisms, On the number of subwords of everywhere growing DTOL languages, On the stability of some biological schemes with cellular interactions, A relationship between ETOL and EDTOL languages, More on ETOL systems versus random context grammars, On slicing of K-iteration grammars, The DOL-ness for context-free languages is decidable, Surface tree languages and parallel derivation trees, Generalized time-delayed OL languages, The goodness of \(\{S,a\}\)-EOL forms is decidable, New squeezing mechanisms for L systems, TIL systems and languages, Iterating iterated substitution, Problèmes decidables concernant les TOL-langages unaires, Two characterization theorems of locally catenative developmental systems, On complements of unary L languages, A note on DOL length sets, EOL languages are not codings of FPOL languages, Recognition of EOL languages in less than quartic time, On the structure of derivations in deterministic ETOL systems, Unnamed Item, GROWING CELLULAR SYSTEMS: GENERATION OF GRAPHS BY PARALLEL REWRITING, Priorities on context conditions in rewriting systems, Rewriting systems with a clocking mechanism, Speed-varying OL systems, Normal form of extended table matrix L systems, Size of context in regenerative IL systems, On a relationship between graph L-systems and picture languages, Stability of desynchronized 0L-systems, Homomorphic images of sentential form languages defined by semi-Thue systems, Stability in L systems, Fair derivations in E0L systems, A periodic division pattern that cannot be generated by D0L systems, A morphic representation of EOL languages and other ETOL languages, A note on an extension of matrix grammars generating two-dimensional languages
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Development systems with locally catenative formulas
- The unsolvability of the equality problem for sentential forms of context-free grammars
- Direct proofs of the undecidability of the equivalence problem for sentential forms of linear context-free grammars and the equivalence problem for OL systems
- The equality of EOL languages and codings of ol languages
- Closure properties of some families of languages associated with biological systems
- An extension of ALGOL-like languages
- Two Families of Languages Related to ALGOL
- On 0L-Languages
- A biologically motivated extension of ALGOL-like languages
- On the nonexistence of a phrase structure grammar for ALGOL 60
