Complete System of Equivalent Transformations for Multitape Automata

Complete System of Equivalent Transformations for Multitape Automata

A classical model of computations—multitape automata—is considered. For any n, n ≥ 2, a system of equivalent transformations that is complete in the set of all n-tape automata is constructed.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Programming and computer software 2003-01, Vol.29 (1), p.43-54
1. Verfasser: Khachatryan, V. E
Format: Artikel
Sprache:eng
Schlagworte:
Automata theory
Equivalence
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A classical model of computations—multitape automata—is considered. For any n, n ≥ 2, a system of equivalent transformations that is complete in the set of all n-tape automata is constructed.
ISSN:0361-7688
1608-3261
DOI:10.1023/A:1021967930348