Subword complexities of various classes of deterministic developmental languages without interactions
- 30 June 1975
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 1 (1), 59-75
- https://doi.org/10.1016/0304-3975(75)90012-2
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- The length sets of D0L languages are uniformly boundedInformation Processing Letters, 1974
- Dol sequencesDiscrete Mathematics, 1974
- Characterization of unary developmental languagesDiscrete Mathematics, 1973
- Integral sequential word functions and growth equivalence of lindenmayer systemsInformation and Control, 1973
- A limit theorem for sets of subwords in deterministic TOL languagesInformation Processing Letters, 1973
- Developmental systems with locally catenative formulasActa Informatica, 1973
- On the membership question in some Lindenmayer-systemsIndagationes Mathematicae, 1972
- On 0L-LanguagesInformation and Control, 1971
- Developmental systems without cellular interactions, their languages and grammarsJournal of Theoretical Biology, 1971
- Mathematical models for cellular interactions in development I. Filaments with one-sided inputsJournal of Theoretical Biology, 1968