On the equivalence problem for deterministic multitape automata and transducers
From MaRDI portal
Publication:5096179
DOI10.1007/BFb0029008zbMath1492.68078MaRDI QIDQ5096179
Juhani Karhumäki, Karel II Culik
Publication date: 16 August 2022
Published in: STACS 89 (Search for Journal in Brave)
Related Items
Cites Work
- HDTOL matching of computations of multitape automata
- 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
- On the decidability of homomorphism equivalence for languages
- Loops in automata and HDTOL relations
- A Purely Homomorphic Characterization of Recursively Enumerable Sets
- The equivalence problem for deterministic finite-turn pushdown automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the equivalence problem for deterministic multitape automata and transducers