Every two equivalent D0L systems have a regular true envelope
TLDR
It is proved that every two equivalent D0L systems have a regular true envelope and this is an open problem and can be solved by extending some proof techniques from [2] and [3].About:
This article is published in Theoretical Computer Science.The article was published on 1980-01-01 and is currently open access. It has received 6 citations till now. The article focuses on the topics: Envelope (waves) & Open problem.read more
Citations
More filters
Journal ArticleDOI
Equality languages and fixed point languages
TL;DR: A new subclass of dgsm mappings is introduced, the so-called symmetric dgSm mappings, which it is proved that (unlike for arbitrary dg sm mappings) their fixed-point languages are regular but not effectively obtainable.
Journal ArticleDOI
The ω sequence problem for DOL systems is decidable
Karel Culik,Tero Harju +1 more
TL;DR: From this result easily follows the decidability of limit language equivalence (~-eqmvalence) for D0L systems.
Proceedings ArticleDOI
The Ω-sequence equivalence problem for DOL systems is decidable
Karel Culik,Tero Harju +1 more
TL;DR: In this article, it was shown that σ(σi) is a proper prefix of σn+1i (σi), for σi = 1, 2 and all n ≥ 0.
Journal ArticleDOI
Dominoes over a free monoid
Karel Culik,Tero Harju +1 more
TL;DR: A new simple algorithm for testing DOL sequence equivalence is presented and dominoes over a free monoid and operations on them are introduced.
Journal ArticleDOI
An n 2-bound for the ultimate equivalence problem of certain D0L systems over an n-letter alphabet
TL;DR: It is shown that for a large class of D0L systems, to decide the ultimate equivalence problem, it suffices to check whether or not g^i (w)=h^i(w) holds for suitably chosen card(X)^2 consecutive values of i.
References
More filters
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?
Journal ArticleDOI
Elementary homomorphisms and a solution of the D0L sequence equivalence problem
TL;DR: An alternative (and simpler than the one presented in [1]) proof that the D0L (sequence) equivalence problem is decidable is provided.