On a family of acceptors for some classes of developmental languages
- 1 January 1974
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 4 (1-4) , 199-228
- https://doi.org/10.1080/00207167408803089
Abstract
A machine model, which consists essentially of a finite state control and an array of counters with first-in-last-out access, is formulated and it is proved that, under certain restrictions, the class of languages accepted is identical to the class of developmental languages without interactions.Keywords
This publication has 10 references indexed in Scilit:
- Mathematical models for cellular interactions in development I. Filaments with one-sided inputsPublished by Elsevier ,2004
- Developmental systems and languagesPublished by Association for Computing Machinery (ACM) ,1972
- On the membership question in some Lindenmayer-systemsIndagationes Mathematicae, 1972
- On 0L-LanguagesInformation and Control, 1971
- I. General description and the problem of universal computing abilityInternational Journal of Systems Science, 1971
- A note on some systems of lindenmayerTheory of Computing Systems, 1971
- Developmental systems without cellular interactions, their languages and grammarsJournal of Theoretical Biology, 1971
- Role of environment in developmental modelsJournal of Theoretical Biology, 1970
- Computing ability of a developmental model for filamentous organismsJournal of Theoretical Biology, 1969
- Thioguanine-dependent Light Sensitivity of Perithecial Initiation in Sordaria fimicolaJournal of General Microbiology, 1969