Elementary homomorphisms and a solution of the D0L sequence equivalence problem
TLDR
An alternative (and simpler than the one presented in [1]) proof that the D0L (sequence) equivalence problem is decidable is provided.About:
This article is published in Theoretical Computer Science.The article was published on 1978-01-01 and is currently open access. It has received 75 citations till now. The article focuses on the topics: Homomorphism & Decidability.read more
Citations
More filters
Book ChapterDOI
Combinatorics of words
TL;DR: This is a survey on combinatorics of words to appear as a chapter in Handbook of Formal Languages about defect effect, equations as properties of words, periodicity, finiteness conditions, avoidabilty and subword complexity.
Book
Codes and Automata
TL;DR: This paper presents a meta-anatomy of the polynomials of finite codes using a model derived from the model developed in [Bouchut-Boyaval, M3AS (23) 2013].
Book
L Systems
TL;DR: The fundamental L families constitute a similar testing ground as the Chomsky hierarchy when new devices (grammars, automata, etc.) and new phenomena are investigated in language theory.
Journal ArticleDOI
Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
TL;DR: Very simple languages are introduced which play the same role for the class of recursively enumerable languages that the Dyck languages play for theclass of context-free languages.
BookDOI
Combinatorics, Automata and Number Theory
Valrie Berth,Michel Rigo +1 more
TL;DR: In this article, the authors present recent trends arising from the fruitful interaction between the themes of combinatorics on words, automata and formal language theory, and number theory and reveal some of the exciting and important relationships that exist between these different fields.
References
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
Subword complexities of various classes of deterministic developmental languages without interactions
TL;DR: It is shown that each everywhere growing DIL language is the image under a coding of an everywhere growing (uniform)DOL language, which enable us to solve the subword complexity problems for developmental languages with interactions.
Journal ArticleDOI
The decidability of the equivalence problem for DOL-systems*
Karel Culik,Ivan Fris +1 more
TL;DR: The language and sequence equivalence problem for DOL-systems is shown to be decidable and can be stated as follows: Given homomorphisms h, and h, on a free monoid z1* and a word D from Z*, is %rn(r,) = &“(o) for all n > O?
Book
Advances in Information Systems Science
TL;DR: This volume, the eighth of a continuing series on information systems science, presents five timely topics which are of current interest in this growing field: file or ganization and performance evaluation, computational semantics, digital control, clustering analysis, and geometric modeling.