Revisiting the Equivalence Problem for Finite Multitape Automata

DOI10.1007/978-3-642-39212-2_38zbMath1334.68124arXiv1303.6704OpenAlexW1596143700MaRDI QIDQ5327452

James Worrell

Publication date: 7 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.6704

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines ⋮ Algorithm for establishing the equivalence of deterministic multitape automata ⋮ Multipartite rational functions ⋮ Polynomial algorithm for equivalence problem of deterministic multitape finite automata

This page was built for publication: Revisiting the Equivalence Problem for Finite Multitape Automata