Deterministic Lindenmayer languages, nonterminals and homomorphisms
TLDR
A systematic classification of the effect of nonterminals, letter-to-letter homomorphicisms, nonerasing homomorphisms and homomorphism for all the basic types of deterministic Lindenmayer systems using context is contained.About:
This article is published in Theoretical Computer Science.The article was published on 1976-06-01 and is currently open access. It has received 9 citations till now. The article focuses on the topics: Abstract family of languages & Cone (formal languages).read more
Citations
More filters
Book
The mathematical theory of L systems
Grzegorz Rozenberg,Arto Salomaa +1 more
TL;DR: A survey of the different areas of the theory of developmental systems and languages in such a way that it discusses typical results obtained in each particular problem area.
Journal ArticleDOI
Iterated a-NGSM maps and Γ systems*
TL;DR: The notion of an iterated Γ map, that is, a nondeterministic generalized sequential machine with accepting states, is introduced, which leads to the notions of Γ systems and languages.
Journal ArticleDOI
Stable string languages of lindenmayer systems
Paul M. B. Vitányi,Adrian Walker +1 more
TL;DR: The equivalence of a biologically highly relevant notion, i.e., that of equilibrium oriented behavior in models of morphogenesis, and the formal language concept of intersection with a terminal alphabet, establishes a new link between formal language theory and theoretical biology.
Journal ArticleDOI
Context-Dependent L Forms*
TL;DR: The family of context-free languages is generated by an EIL form (contrary to the earlier results concerning context- free L forms) and, as regards reducibility in the amount of context, EIL forms lie between IL and EIL systems.
References
More filters
Journal ArticleDOI
Theory of Recursive Functions and Effective Computability.
Solomon Feferman,Hartley Rogers +1 more
TL;DR: Central concerns of the book are related theories of recursively enumerable sets, of degree of un-solvability and turing degrees in particular and generalizations of recursion theory.
Book
Computation: Finite and Infinite Machines
TL;DR: In this article, the authors present an abstract theory that categorically and systematically describes what all these machines can do and what they cannot do, giving sound theoretical or practical grounds for each judgment, and the abstract theory tells us in no uncertain terms that the machines' potential range is enormous and that its theoretical limitations are of the subtlest and most elusive sort.
Book
Formal Languages and Their Relation to Automata
TL;DR: The theory of formal languages as a coherent theory is presented and its relationship to automata theory is made explicit, including the Turing machine and certain advanced topics in language theory.
Journal ArticleDOI
Mathematical models for cellular interactions in development. I. Filaments with one-sided inputs.
TL;DR: A theory is proposed for the development of filamentous organisms, based on the assumptions that the filaments are composed of cells which undergo changes of state under inputs they receive from their neighbors, and the cells produce outputs as determined by their state and the input they receive.