The equivalence problem for languages defined by transductions on D0L languages

DOI10.1080/00207160412331336116zbMath1101.68051OpenAlexW2057544562MaRDI QIDQ5462883

Juha Honkala

Publication date: 27 July 2005

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160412331336116

zbMATH Keywords

D0L systemlanguage equivalence problemsequential transducer

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Finite transducers and rational transductions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The equivalence of finite valued transducers (on HDT0L languages) is decidable
• Iteration of maps by an automaton
• The language equivalence problem for HD0L systems having D0L growths
• On sentential forms of context-free grammars
• The equivalence problem for deterministic TOL-systems is undecidable
• The decidability of the equivalence problem for DOL-systems
• Automatic Sequences
• On the decidability of some equivalence problems for DOL-systems
• The Equivalence Problem of Finite Substitutions on ab*c, with Applications

This page was built for publication: The equivalence problem for languages defined by transductions on D0L languages