Polynomial algorithm for equivalence problem of deterministic multitape finite automata
type: Item
instance of: scholarly article
title: Polynomial algorithm for equivalence problem of deterministic multitape finite automata
zbMATH Open document ID: 1451.68149
author: Hayk Grigoryan
author: Samvel K. Shoukourian
published in: Theoretical Computer Science
publication date: 2020-08-03T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 7226874
zbMATH Keywords: deterministic multitape finite automata
zbMATH Keywords: equivalence
zbMATH Keywords: polynomial complexity
MaRDI profile type: Publication
full work available at URL: j.tcs.2020.05.044
OpenAlex ID: W3033311762
cites work: Q5541339
cites work: The equivalence problem for deterministic two-tape automata
cites work: The equivalence problem of multitape finite automata
cites work: The Equivalence Problem of Deterministic Multitape Finite Automata: A New Proof of Solvability Using a Multidimensional Tape
cites work: Reducibility of program-scheme functional equivalence on a nondegenerate basis of rank unity to the equivalence of automata with multidimensional tapes
cites work: Q3738586
cites work: Q3287249
cites work: Q3848243
cites work: Revisiting the Equivalence Problem for Finite Multitape Automata
DOI: 10.1016/J.TCS.2020.05.044
description: scientific article; zbMATH DE number 7226874