Loops in automata and HDTOL relations
From MaRDI portal
Publication:3479541
DOI10.1051/ita/1990240403271zbMath0701.68079MaRDI QIDQ3479541
Juhani Karhumäki, Karel II Culik
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
68Q45: Formal languages and automata
Related Items
HDTOL matching of computations of multitape automata, New techniques for proving the decidability of equivalence problem
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item