Algorithm for establishing the equivalence of deterministic multitape automata

DOI10.1007/S10559-015-9764-3zbMath1328.68109OpenAlexW2330629631MaRDI QIDQ904421

V. I. Borisenko

Publication date: 13 January 2016

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-015-9764-3

zbMATH Keywords

equivalencedeterministic automatamultitape automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• The equivalence problem for deterministic two-tape automata
• The equivalence problem of multitape finite automata
• Sufficient equivalence condition for \(n\)-tape automata
• The Equivalence Problem of Deterministic Multitape Finite Automata: A New Proof of Solvability Using a Multidimensional Tape
• Revisiting the Equivalence Problem for Finite Multitape Automata

This page was built for publication: Algorithm for establishing the equivalence of deterministic multitape automata