On the Equivalence Problem of Context-free and DT0L Languages
- Computer ScienceDiscret. Appl. Math.
SHOWING 1-10 OF 16 REFERENCES
Regularity Properties of L Ambiguities of Morphisms
We study the L ambiguity of morphisms of the free monoid. We define four basic ambiguity sets and establish their effective regularity in many cases. Decidability results concerning L codes are…
L Morphisms: Bounded Delay and Regularity of Ambiguity
We present characterization and decidability results concerning bounded delay of L codes. It is also shown that, for L morphisms (morphisms applied in the “L way”), the sets causing ambiguities are…
On the number of subwords of everywhere growing DTOL languages
- Computer ScienceDiscret. Math.
A Morphic Representation of Complements of Recursively Enumerable Sets
It turns out that going through all propagating morphismsf and g, the family of maximal solutions obtained equals the famdy of complements of recursively enumerable languages after intersecting with regular languages and mapping with propagating Morphisms.
The mathematical theory of L systems
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.
A morphic representation of EOL languages and other ETOL languages
- LinguisticsDiscret. Appl. Math.
Subword Complexities of Various Classes of Deterministic Developmental Languages without Interactions
- Computer ScienceTheor. Comput. Sci.
Developmental systems and languages
- Computer ScienceSTOC
Developmental systems were introduced in order to model morphogenetic (pattern-generating) processes in growing, multicellular, filamentous organisms by considering the states and outputs to be identical and thus omitting the output functions.