Complete system of equivalent transformations for two-tape automata with disjoint loops
type: Item
instance of: scholarly article
title: Complete system of equivalent transformations for two-tape automata with disjoint loops
zbMATH Open document ID: 0968.68085
DOI: 10.1007/BF02759317
author: R. I. Podlovchenko
author: V. E. Khachatryan
author: Yu. G. Chashin
published in: Programming and Computer Software
publication date: 2001-01-15T00:00:00Z
review text: Two-tape automata are considered such that their transition diagrams do not have intersecting loops. A system of equivalent transformations is described for these automata, and its completeness with respect to the set of the transformations is proved.
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1551553
zbMATH Keywords: two-tape automata
MaRDI profile type: Publication
cites work: Q4991691
cites work: The equivalence problem for deterministic two-tape automata
cites work: The equivalence problem of multitape finite automata
cites work: Q3951550
cites work: On the construction of complete systems of equivalent transformations of program schemes
full work available at URL: https://doi.org/10.1007/bf02759317
OpenAlex ID: W2053272634
description: scientific article; zbMATH DE number 1551553