The ultimate equivalence problem for DOL systems
From MaRDI portal
Publication:1249437
DOI10.1007/BF00260925zbMath0385.68060MaRDI QIDQ1249437
Publication date: 1978
Published in: Acta Informatica (Search for Journal in Brave)
Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (9)
Unnamed Item ⋮ On the periodicity of morphisms on free monoids ⋮ On some decidability problems for HDOL systems with nonsingular Parikh matrices ⋮ On infinite words obtained by iterating morphisms ⋮ A homomorphic characterization of time and space complexity classes of languages† ⋮ Homomorphism equivalence on etol languages† ⋮ EQUALITY SETS OF MORPHIC WORD SEQUENCES ⋮ An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet ⋮ On test sets for checking morphism equivalence on languages with fair distribution of letters
This page was built for publication: The ultimate equivalence problem for DOL systems
