scientific article
From MaRDI portal
Publication:4062662
zbMath0306.68045MaRDI QIDQ4062662
Gabor T. Herman, Grzegorz Rozenberg
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Population dynamics (general) (92D25) Research exposition (monographs, survey articles) pertaining to computer science (68-02) General biology and biomathematics (92B05) Research exposition (monographs, survey articles) pertaining to biology (92-02)
Related Items (84)
Filamentous systems with apical growth ⋮ Transductions and the parallel generation of languages† ⋮ Hyperedge replacement with rendezvous ⋮ A note on regular-controlled apical-growth filamentous systems ⋮ Inference algorithms for developmental systems with cell lineages ⋮ L-SYSTEMS IN GEOMETRIC MODELING ⋮ FROM ARTIFICIAL LIFE TO REAL LIFE: COMPUTER SIMULATION OF PLANT GROWTH∗ ⋮ Unnamed Item ⋮ Cellular automata as a paradigm for ecological modeling ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the relations between the degree of synchronization and the degree of nondeterminism ink-limited and uniformlyk-limited tol systems ⋮ Fuzzy L-systems ⋮ On some open problems about marcus contextual languages ⋮ Pumping lemmas for the control language hierarchy ⋮ On some models for developmental systems Part XII. More on internal context sensitivity ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Comparison of basic language generating devices (non-deterministic systems) ⋮ Information transmission in il systems∗ ⋮ Two lower bounds on distributive generation of languages ⋮ On some models for developmental systems Part IV. Cellular composition of certain systems with feedback: numerical and matrix approach ⋮ On the computational power of totalistic cellular automata ⋮ MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS ⋮ Unnamed Item ⋮ Context-free grammars with selective rewriting ⋮ Sur les centres de DOL-langages ⋮ Formes de langages et de grammaires ⋮ On the power of the splicing operation1 ⋮ On cooperating—distributed extended limited 0L systems ⋮ The inclusion of D0L in multi-reset ⋮ Subword complexities of various classes of deterministic developmental languages with interactions ⋮ The equality of EOL languages and codings of ol languages ⋮ Unnamed Item ⋮ Complete symmetry in d2l systems and cellular automata ⋮ Index on etol array languages ⋮ Machine characterization of eol-regular matrix systems ⋮ Languages and P0L schemes ⋮ On some models for developmental systems Part VI. Patterns in developmental systems ⋮ On some models for developmental systems Part VII. On some types of patterns included in a feedback loop ⋮ PARALLEL GRAPH GENERATING AND GRAPH RECURRENCE SYSTEMS FOR MULTICELLULAR DEVELOPMENT† ⋮ JL systems with non-fragmented axioms: The hierarchy ⋮ A note on a family of acceptors for some families of developmental languages† ⋮ Calculating the growth function of a developmental system in the case of asynchronous elementary operations ⋮ The decidability of the dol prefix problem ⋮ Parallel/sequential rectangular arrays with tables ⋮ On grammar forms with terminal context ⋮ Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems ⋮ The tape-complexity of context-independent developmental languages ⋮ Searching neural network structures with L systems and genetic algorithms ⋮ Top-down tree transducers with regular look-ahead ⋮ Context-free and stationary languagest† ⋮ Doubly deterministic tabled OL systems ⋮ An automata-theoretical model of the vegetative and flowering development of Hieracium murorum L ⋮ A periodicity property of iterated morphisms ⋮ On proving that certain languages are not ETOL ⋮ Nonterminals, homomorphisms and codings in different variations of OL- systems. I: Deterministic systems ⋮ Tree controlled grammars ⋮ Two non-closure results on families ofL languages ⋮ Extended linear macro grammars, iteration grammars, and register programs ⋮ Quasi-deterministic 0L systems ⋮ GROWING CELLULAR SYSTEMS: GENERATION OF GRAPHS BY PARALLEL REWRITING ⋮ The complexity of the membership problem for some extensions of context-free languagest† ⋮ Deterministic Lindenmayer Systems with Dynamic Control of Parallelism ⋮ Complexity of some problems concerningL systems ⋮ Concentration dependent OL systems ⋮ On bonded sequential and parallel insertion systems ⋮ A note on dpda transductions of {0,1}∗and inverse dpda transductions of the dyck set ⋮ Principal abstract families of weighted tree languages ⋮ On acceptors of iteration languages ⋮ Congruences Associated with Dol-Schemes ⋮ Indian parallelism on unary ol systems ⋮ On depth in EDTOL languages ⋮ Fixed languages and the adult languages of ol schemest† ⋮ Closure properties of selective substitution grammars part I ⋮ Closure properties of selective substitution grammars ⋮ Modelling economic processes by means of formal grammars: A survey of results at the middle of 1981 ⋮ L homomorphisms and reductions of OL systems ⋮ On some models for developmental systems Part I. Organism structure on the basis of elementary transformations ⋮ Adherences of DOL languages ⋮ Unnamed Item ⋮ Expanded subalphabets in the theories of languages and semigroups†
This page was built for publication:
