DOL sequences
From MaRDI portal
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
- Characterization of unary developmental languages
- Development systems with locally catenative formulas
- scientific article; zbMATH DE number 3476618 (Why is no real title available?)
- scientific article; zbMATH DE number 3550202 (Why is no real title available?)
- 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
- Models for cellular interactions in development without polarity of individual cells II. Problems of synchronization and regulation
- On 0L-Languages
- The equivalence problem for deterministic TOL-systems is undecidable
- TOL systems and languages
Cited in
(8)- A limit theorem for set of subwords in deterministic TOL laguages
- Ambiguity in the developmental systems of Lindenmayer
- Subword complexities of various classes of deterministic developmental languages without interactions
- On the number of subwords of everywhere growing DTOL languages
- EOL languages are not codings of FPOL languages
- The length sets of D0L languages are uniformly bounded
- Concentration dependent OL systems
- Subword complexities of various classes of deterministic developmental languages with interactions
This page was built for publication: DOL sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1846338)
