Polynomial algorithm for equivalence problem of deterministic multitape finite automata
From MaRDI portal
Publication:784484
DOI10.1016/J.TCS.2020.05.044zbMATH Open1451.68149OpenAlexW3033311762MaRDI QIDQ784484FDOQ784484
Authors: Hayk Grigoryan, Samvel K. Shoukourian 
Publication date: 3 August 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.05.044
Recommendations
- Algorithm for establishing the equivalence of deterministic multitape 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
- The equivalence problem of multidimensional multitape automata
- The equivalence problem of multitape finite automata
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The equivalence problem of multitape finite automata
- Title not available (Why is that?)
- The equivalence problem for deterministic two-tape automata
- The Equivalence Problem of Deterministic Multitape Finite Automata: A New Proof of Solvability Using a Multidimensional Tape
- Title not available (Why is that?)
- Reducibility of program-scheme functional equivalence on a nondegenerate basis of rank unity to the equivalence of automata with multidimensional tapes
- Revisiting the equivalence problem for finite multitape automata
Cited In (3)
This page was built for publication: Polynomial algorithm for equivalence problem of deterministic multitape finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q784484)
