Journal ArticleDOI
Extension of tabled 0L-systems and languages
Grzegorz Rozenberg
- Vol. 2, Iss: 4, pp 311-336
TLDR
A new family of languages is introduced which originated from a study of some mathematical models for the development of biological organisms and it is proved that it forms a full abstractfamily of languages.Abstract:
This paper introduces a new family of languages which originated from a study of some mathematical models for the development of biological organisms. Various properties of this family are established and in particular it is proved that it forms a full abstract family of languages. It is compared with some other families of languages which have already been studied and which either originated from the study of models for biological development or belong to the now standard Chomsky hierarchy. A characterization theorem for context-free languages is also established.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
Tree Transducers, L Systems, and Two-Way Machines
TL;DR: A relationship between parallel rewriting systems and two-way machines is investigated, finding restrictions on the “copying power” of these devices endow them with rich structuring and give insight into the issues of determinism, parallelism, and copying.
Book
Models of tree translation
TL;DR: This first chapter gives an introduction into the area of tree transducer theory, and describes the results presented in Chapters 2–6, as well as addressing general issues like translations, trees, and tree grammars.
Journal ArticleDOI
Three hierarchies of transducers
TL;DR: Composition of top-down tree transducers yields a proper hierarchy of transductions and of output languages for ETOL systems and for two-way generalized sequential machines.
Journal ArticleDOI
TOL Schemes and Control Sets
TL;DR: When a regular start set L and a regular control set C are given, the set C (L) is an ETOL language, and it is shown that the set ∋(∑) of all possible homomorphisms from a given alphabet ∑ into itself cannot be a control set.
References
More filters
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.
Journal ArticleDOI
Mathematical models for cellular interactions in development. II. Simple and branching filaments with two-sided inputs.
TL;DR: The treatment is extended to cases where inputs are received by each cell from both directions along the filament, and the change of state and the output of a cell is determined by its presentState and the two inputs it receives.