The Ω-sequence equivalence problem for DOL systems is decidable. The following problem is shown to be decidable. Given are homomorphisms h1 and h2 from Σ* to Σ* and strings σ1 and σ2 over Σ such that hni(σi) is a proper prefix of hn+1i (σi) for i = 1, 2 and all n ≥ 0, i.e. for i = 1, 2, hi generates from σi an ...
Culik II and Harju have shown that the ω-equivalence problem is decidable for D0L systems. We give a new proof of this result.
A new proof of the ω-equivalence problem is decidable for D0L systems is given and Culik II and Harju's result is given. Culik II and Harju have shown that ...
top We give a bound for the -equivalence problem of polynomially bounded D0L systems which depends only on the size of the underlying alphabet. How to cite.
We give a bound for the ω-equivalence problem of polynomially bounded D0L systems which depends only on the size of the underlying alphabet. Mathematics Subject ...
Culik II and Harju have shown that the ω-equivalence problem is decidable fot D0L systems. We give a partially new proof of this result by using elementary ...
A bound for the sequence equivalence problem of polynomially bounded D0L systems which depends only on the size of the underlying alphabet is given.
The Ultimate Equivalence Problem for DOL Systems. - ResearchGate
www.researchgate.net › ... › Systems
Oct 22, 2024 · The ultimate equivalence problem for DOL systems is shown to be recursively decidable. In algebraic formulation this problem can be stated ...
REMARKS CONCERNING THE D0L ω-EQUIVALENCE PROBLEM · On infinite words obtained by iterating morphisms · On the decidability of the sequence equivalence problem for ...
The ultimate equivalence problem for DOL systems consists of deciding, given two morphisms g : X* -> X*, h : X* -> X* and a word omega is an element of X*, ...