Authors : N.K. Zarubina and V.P. Dobritsa
Abstract: 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.
N.K. Zarubina and V.P. Dobritsa, 2016. About Realization of Some Turing Machine is Finite-State and Store Machines with the Exit. International Journal of Soft Computing, 11: 131-135.