TY  - JOUR
T1  - About Realization of Some Turing Machine is Finite-State and Store
Machines with the Exit
AU - Zarubina, N.K. AU - Dobritsa, V.P. 
JO  - International Journal of Soft Computing
VL  - 11
IS  - 3
SP  - 131
EP  - 135
PY  - 2016
DA  - 2001/08/19
SN  - 1816-9503
DO  - ijscomp.2016.131.135
UR  - https://makhillpublications.co/view-article.php?doi=ijscomp.2016.131.135
KW  - Finite-state machine
KW  -the store automatic machine
KW  -the store automatic machine with an exit
KW  -Turings machine
KW  -Russia
AB  - The concept of the store automatic machine with an exit from the point of view of computability theory is entered. The comparative analysis of the entered concept with automatic machine with store memory from the point of view of formal languages and grammars is carried out. Examples of automatic realization of some cars of Turing by means of finite-state and store machines with exits are reviewed. It is proved that the circle of the tasks realized by the store automatic machine with an exit is wider, than at the finite-state machine with an exit, but already, than at Turing’s machine.
ER  -