The ω sequence problem for DOL systems is decidable
From MaRDI portal
Publication:3769989
DOI10.1145/62.2161zbMath0632.68078OpenAlexW2020466367MaRDI QIDQ3769989
Publication date: 1984
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/62.2161
homomorphismsdecidabilityinfinite wordsD0L systemsparallel rewriting systems\(\omega \)-equivalencelimit language equivalence
Related Items (12)
The equality problem for infinite words generated by primitive morphisms ⋮ On the subword equivalence problem for morphic words ⋮ A bound for theω-equivalence problem of polynomial D0L systems ⋮ Iterative devices generating infinite words ⋮ REMARKS CONCERNING THE D0L ω-EQUIVALENCE PROBLEM ⋮ On infinite words generated by polynomial D0L systems ⋮ On infinite HD0L words having sparse letters ⋮ ON UNIFORMLY RECURRENT MORPHIC SEQUENCES ⋮ Decidability of periodicity for infinite words ⋮ DECIDABILITY OF UNIFORM RECURRENCE OF MORPHIC SEQUENCES ⋮ THE D0L ω-EQUIVALENCE PROBLEM ⋮ On D0L systems with immigration
This page was built for publication: The ω sequence problem for DOL systems is decidable