Loops in automata and HDTOL relations

DOI10.1051/ita/1990240403271zbMath0701.68079OpenAlexW23690154MaRDI QIDQ3479541

Karel II Culik, Juhani Karhumäki

Publication date: 1990

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92361

zbMATH Keywords

HDTOL relationn-tape automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

On the equivalence problem for deterministic multitape automata and transducers ⋮ New techniques for proving the decidability of equivalence problem ⋮ HDTOL matching of computations of multitape automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• HDTOL matching of computations of multitape automata
• Intersections de langages algébriques bornes
• The equivalence problem for deterministic two-tape automata
• Systems of equations over a free monoid and Ehrenfeucht's conjecture
• The inclusion problem for some classes of deterministic multitape automata
• The equivalence of finite valued transducers (on HDT0L languages) is decidable
• AFL with the semilinear property
• A Purely Homomorphic Characterization of Recursively Enumerable Sets

This page was built for publication: Loops in automata and HDTOL relations