THE D0L ω-EQUIVALENCE PROBLEM
From MaRDI portal
Publication:3426793
DOI10.1142/S0129054107004620zbMath1108.68069OpenAlexW2141787916MaRDI QIDQ3426793
Publication date: 13 March 2007
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054107004620
Related Items (3)
The equality problem for infinite words generated by primitive morphisms ⋮ On the simplification of infinite morphic words ⋮ ON UNIFORMLY RECURRENT MORPHIC SEQUENCES
Cites Work
- Unnamed Item
- The class of HDT0L sequences is closed with respect to rational functions
- On infinite words obtained by iterating morphisms
- On the decidability of the sequence equivalence problem for DOL-systems
- Elementary homomorphisms and a solution of the DOL sequence equivalence problem
- The equivalence problem of polynomially bounded D0L systems -- a bound depending only on the size of the alphabet
- A short solution for the HDT0L sequence equivalence problem
- An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet
- REMARKS CONCERNING THE D0L ω-EQUIVALENCE PROBLEM
- The ω sequence problem for DOL systems is decidable
- The decidability of the equivalence problem for DOL-systems
This page was built for publication: THE D0L ω-EQUIVALENCE PROBLEM
