The ultimate equivalence problem for DOL systems

DOI10.1007/BF00260925MaRDI QIDQ1249437zbMATH OpenFDO

Authors Karel II Culik

Publication date 1978

Published in Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25) Semigroups in automata theory, linguistics, etc. (20M35)

Cited in

(9)

• On some decidability problems for HDOL systems with nonsingular Parikh matrices
• Homomorphism equivalence on etol languages†
• On the periodicity of morphisms on free monoids
• Equality sets of morphic word sequences
• An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet
• A homomorphic characterization of time and space complexity classes of languages†
• scientific article; zbMATH DE number 3866597 (Why is no real title available?)
• On test sets for checking morphism equivalence on languages with fair distribution of letters
• On infinite words obtained by iterating morphisms

This page was built for publication: The ultimate equivalence problem for DOL systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1249437)