Development systems with locally catenative formulas
From MaRDI portal
Publication:1216962
DOI10.1007/BF00289079zbMath0304.68076OpenAlexW1985992247MaRDI QIDQ1216962
Aristid Lindenmayer, Grzegorz Rozenberg
Publication date: 1973
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00289079
Formal languages and automata (68Q45) General topics in the theory of software (68N01) General biology and biomathematics (92B05)
Related Items (23)
A generalization of automatic sequences ⋮ The local catenativity of DOL-sequences in free commutative monoids is decidable in the binary case ⋮ Extension of tabled 0L-systems and languages ⋮ Subword complexities of various classes of deterministic developmental languages with interactions ⋮ Description of developmental languages using recurrence systems ⋮ Sur des points fixes de morphismes d'un monoïde libre ⋮ The decidability of the dol prefix problem ⋮ Subword complexities of various classes of deterministic developmental languages without interactions ⋮ Time-delayed OL languages and sequences ⋮ On the number of subwords of everywhere growing DTOL languages ⋮ Doubly deterministic tabled OL systems ⋮ Generalized time-delayed OL languages ⋮ Nonterminals, homomorphisms and codings in different variations of OL- systems. I: Deterministic systems ⋮ Two characterization theorems of locally catenative developmental systems ⋮ The decidability of v-local catenativity and of other properties of DOL systems ⋮ Combinatorics of words and morphisms in some pieces of Tom Johnson ⋮ GROWING CELLULAR SYSTEMS: GENERATION OF GRAPHS BY PARALLEL REWRITING ⋮ A generalization of automatic sequences ⋮ Algorithms for producing grammars from sample derivations: a common problem of formal language theory and developmental biology ⋮ Characterization of unary developmental languages ⋮ The length sets of D0L languages are uniformly bounded ⋮ DOL sequences ⋮ On standard locally catenative L schemes
Cites Work
- Unnamed Item
- Unnamed Item
- Algorithms for producing grammars from sample derivations: a common problem of formal language theory and developmental biology
- Closure properties of some families of languages associated with biological systems
- A note on some systems of lindenmayer
- I. General description and the problem of universal computing ability
- On 0L-Languages
This page was built for publication: Development systems with locally catenative formulas
