No label defined (Q3785947)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4049055
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4049055 |
Statements
1986
0 references
automaton model of Turing machines
0 references
AMTM
0 references
finite Moore automaton
0 references
equivalence relations
0 references
0 references
0 references
0 references
An automaton model of Turing machines (AMTM) is considered; for every given Turing machine this model consists of a finite Moore automaton (defining automaton) and the program of this Turing machine. A family of equivalence relations on these AMTM's is defined. It is stated that: 1) If the considered equivalence relation is induced by a correct and meaningful equivalence relation on the set of histories (of functioning of AMTM's), then from the equivalence of AMTM's follows the (usual) equivalence of corresponding Turing machines; 2) there is an equivalence relation on AMTM's with mentioned above properties such that it is decidable.
0 references