scientific article; zbMATH DE number 3802813

Publication date: 1980

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

L systems finite substitutions iterated homomorphisms

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Grammars and rewriting systems (68Q42)

Related Items

Hyperedge replacement with rendezvous, Unnamed Item, THE BASE PROBLEM FOR D0L PARIKH SETS, CONFIGURATIONAL ENTROPY FOR STONE-INFLATION HEXAGONAL AND OCTAGONAL PATTERNS, A Construction of Inflation Rules for Pisot Octagonal Tilings, Lindenmayer Systems, A bound for theω-equivalence problem of polynomial D0L systems, Equations in virtually abelian groups: Languages and growth, Machine characterization of terminal weighted eol languages, On the equivalence problem for deterministic multitape automata and transducers, Iterative devices generating infinite words, Parallel complexity of iterated morphisms and the arithmetic of small numbers, Two lower bounds on distributive generation of languages, Complexity of EOL structural equivalence, Unnamed Item, EDT0L grammars with only one variable have tractable generating functions, Impossibility of strict assembly of infinite fractals by oritatami, Decidable problems in substitution shifts, A rewriting of Fife's theorem about overlap-free words, Cooperating grammars' systems: Power and parameters, An iteration property of Lindenmayerian power series, From colonies to eco(grammar)systems, On the size of components of cooperating grammar systems, Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars, On the power of the splicing operation¹, Unnamed Item, Ergodic frequency measures for random substitutions, If a DOL language is k-power free then it is circular, Examples of Morphological Calculus, Generalized Sturmian languages, Grammar systems: A grammatical approach to distribution and cooperation, Cellworks with cell rewriting and cell packing for plant morphogenesis, Subapical bracketed L-systems, Substitutions par des motifs en dimension 1, A graph approach to computing nondeterminacy in substitutional dynamical systems, Equivalent language models that closely simulate one another and their illustration in terms ofLsystems, Searching neural network structures with L systems and genetic algorithms, Membrane Systems Using Noncooperative Rules with Unconditional Halting, A periodicity property of iterated morphisms, The Minimum Substring Cover Problem, Abelian squares are avoidable on 4 letters, Quasi-deterministic 0L systems, The equivalence problem for languages defined by transductions on D0L languages, Deterministic Lindenmayer Systems with Dynamic Control of Parallelism, On bonded sequential and parallel insertion systems, On infinite HD0L words having sparse letters, Decidability of periodicity for infinite words, Outils et résultats pour les transducteurs boustrophédons, It is decidable whether or not a permutation-free morphism is an l code, Multi grammars, On morphically generated formal power series, Robustness of decentralized knowledge systems: a grammar-theoretic view, Filamentous systems with apical growth, Cut point languages of markov DTOL systems, P Systems with Chained Rules, Transductions and the parallel generation of languages^†, The complexity of solution sets to equations in hyperbolic groups, Concerning two-adjacent context-free languages, Prescribed teams of grammars, A combinatorial property of EOL languages, On Sequences Defined by D0L Power Series, Inference algorithms for developmental systems with cell lineages, Some decision problems for parallel communicating grammar systems, Periodic endomorphisms of a free monoid, Neuronal growth via hybrid system of self-growing and diffusion based grammar rules. I, P Systems with Toxic Objects, L-SYSTEMS IN GEOMETRIC MODELING, On cooperating/distributed grammar systems with different styles of acceptance, A new bound for the D0L sequence equivalence problem, Iterated sequential transducers as language generating devices, Logarithmic equal-letter runs for BWT of purely morphic words, Unnamed Item, Caractérisation des ensembles normaux substitutifs. (Characterization of normal substitutional sets), On grammatical complexity of a class of attractors, Fuzzy L-systems, Loops in automata and HDTOL relations, Unnamed Item, On some open problems about marcus contextual languages, Comparison of basic language generating devices (non-deterministic systems), Elementariness of a finite set of words is co-NP-complete, Systolic Automata and P Systems, One-Sided Random Context Grammars: A Survey, On the computational power of totalistic cellular automata, Measure theoretic entropy of random substitution subshifts, On the Computational Power of Enhanced Mobile Membranes, Context-free grammars with selective rewriting, Sur les centres de DOL-langages, D0L sequence equivalence is inPfor fixed alphabets, Elliptic curves and Fibonacci numbers arising from Lindenmayer system with symbolic computation, A new bound for the D0L language equivalence problem, EOL and ETOL array languages, The set of strings mapped into a submonoid by iterates of a morphism, On the equivalence problem of context-free and DT0L languages, On lindenmayerian rational subsets of monoids, Restricted use of the splicing operation¹, Recurrent sets, Periodicity Problem of Substitutions over Ternary Alphabets, Complete symmetry in d2l systems and cellular automata, Index on etol array languages, Density of grammar forms. part I, Density of grammar forms part II, Machine characterization of eol-regular matrix systems, Abstract grammars based on transductions, Complexity of E0L structural equivalence, Fairness on synchronized eol array systems, Unnamed Item, On problems related to growth, entropy, and spectrum in group theory, P and dP Automata: A Survey, On Some Biologically Motivated Control Devices for Parallel Rewriting, Hierarchy ofk-context-free languages, Extending regular expressions with homomorphic replacement, Unnamed Item, ON THE DESCRIPTIONAL COMPLEXITY OF LINDENMAYER SYSTEMS, Unnamed Item, Unnamed Item, Stability in OL systems, Hierarchies of parallel rewriting P systems -- a survey, On the number of components in cooperating distributed grammar systems, On the Images of ℕ-Rational Sequences Counting Multiplicities, GENERATIVE CAPACITY OF SUBREGULARLY TREE CONTROLLED GRAMMARS, HDTOL matching of computations of multitape automata, Finite state and finite stop quantum languages, Computation of sharp estimates of the Poincaré constant on planar domains with piecewise self-similar boundary, Undecidability of Operation Problems for T0L Languages and Subclasses, Unnamed Item, On finite-index indexed grammars and their restrictions, ON THE NUMBER OF ACTIVE SYMBOLS IN LINDENMAYER SYSTEMS, FURTHER RESULTS ON P SYSTEMS WITH PROMOTERS/INHIBITORS, Inference of bounded L systems with polymorphic P systems, On the structure of Mandelbrot's percolation process and other random Cantor sets, DYNAMICALLY FORMED CLUSTERS OF AGENTS IN ECO-GRAMMAR SYSTEMS, Substitutive systems and a finitary version of Cobham's theorem, On the deficit of a finite set of words, COMPARING SUBWORD OCCURRENCES IN BINARY D0L SEQUENCES, Christoffel and Fibonacci Tiles, A characterization of rational D0L power series, Uniform rewriting based on permutations, EOL forms and finite substitutions of ol forms, A remark on regularity of parallel languages, Hierarchie et fermeture de certaines classes de tag-systèmes, Closure properties of selective substitution grammars part I, On the size of the alphabet and the subword complexity of square-free DOL languages, On DOS languages and DOS mappings, Closure properties of selective substitution grammars, THE D0L ω-EQUIVALENCE PROBLEM, On the equivalence of some transductions involving letter to letter morphisms on regular languages, Solutions principales et rang d'un système d'équations avec constantes dans le monoide libre, Code properties and homomorphisms of DOL systems, Lamination languages, Computation theory of cellular automata, Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes, Expanded subalphabets in the theories of languages and semigroups†