Development systems with locally catenative formulas

DOI10.1007/BF00289079MaRDI QIDQ1216962zbMATH OpenOpenAlexFDO

Authors Grzegorz Rozenberg, Aristid Lindenmayer

Publication date 1973

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00289079

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45) General biology and biomathematics (92B05)

Cites work

• A note on some systems of lindenmayer
• 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
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3383530 (Why is no real title available?)
• I. General description and the problem of universal computing ability
• On 0L-Languages

Cited in

(23)

• A generalization of automatic sequences
• 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
• 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
• Characterization of unary developmental languages
• The length sets of D0L languages are uniformly bounded
• DOL sequences
• Algorithms for producing grammars from sample derivations: a common problem of formal language theory and developmental biology
• Sur des points fixes de morphismes d'un monoïde libre
• Doubly deterministic tabled OL systems
• 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
• The decidability of the dol prefix problem
• GROWING CELLULAR SYSTEMS: GENERATION OF GRAPHS BY PARALLEL REWRITING
• A generalization of automatic sequences
• Combinatorics of words and morphisms in some pieces of Tom Johnson
• On standard locally catenative L schemes

This page was built for publication: Development systems with locally catenative formulas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1216962)