Description of developmental languages using recurrence systems
From MaRDI portal
Cites work
- A biologically motivated extension of ALGOL-like languages
- An extension of ALGOL-like languages
- Closure properties of some families of languages associated with biological systems
- Development systems with locally catenative formulas
- Direct proofs of the undecidability of the equivalence problem for sentential forms of linear context-free grammars and the equivalence problem for OL systems
- scientific article; zbMATH DE number 3550202 (Why is no real title available?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- On 0L-Languages
- On the nonexistence of a phrase structure grammar for ALGOL 60
- The equality of EOL languages and codings of ol languages
- The unsolvability of the equality problem for sentential forms of context-free grammars
- Two Families of Languages Related to ALGOL
Cited in
(86)- On a relationship between graph L-systems and picture languages
- Fair derivations in E0L systems
- A morphic representation of EOL languages and other ETOL languages
- A note on an extension of matrix grammars generating two-dimensional languages
- Context dependent table matrix L systems
- Concerning two-adjacent context-free languages
- Interactive L systems with a fast local growth
- Regeneration in 1L systems
- On the degree of synchronization of k1TOL and k1ETOL systems
- 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
- Programmed OL-systems
- A-transducers and the monotonicity of IL schemes
- On DIL schemes simulated by DOL schemes
- 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
- Upper bounds on recognition of a hierarchy of non-context-free languages
- 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
- 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
- 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
- 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
- The Euclidean traveling salesman problem and a space-filling curve
- Normal form of extended table matrix L systems
- Size of context in regenerative IL systems
- On the splicing operation
- A language to describe the growth of neurites
- Extension of tabled 0L-systems and languages
- PARALLEL GRAPH GENERATING AND GRAPH RECURRENCE SYSTEMS FOR MULTICELLULAR DEVELOPMENT†
- GROWING CELLULAR SYSTEMS: GENERATION OF GRAPHS BY PARALLEL REWRITING
- L-system specification of knot-insertion rules for non-uniform B-spline subdivision
- scientific article; zbMATH DE number 605142 (Why is no real title available?)
- A note on parallel splicing on images
- The goodness of \(\{S,a\}\)-EOL forms is decidable
- Fuzzy \(L\) languages
- On commutative DTOL systems
- Quasi-deterministic 0L systems and their representation
- Dynamical properties of PWD0L systems
- Completeness results concerning systolic tree automata and E0L languages
- On the union of 0L languages
- Priorities on context conditions in rewriting systems
- Rewriting systems with a clocking mechanism
- Speed-varying OL systems
- Stability of desynchronized 0L-systems
- Homomorphic images of sentential form languages defined by semi-Thue systems
- Stability in L systems
- A periodic division pattern that cannot be generated by D0L systems
- Iterated sequential transducers as language generating devices
- A model for developmental systems. I: Generating word without any operating system
This page was built for publication: Description of developmental languages using recurrence systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4072878)