International Journal of Soft Computing
Year:
2016
Volume:
11
Issue:
3
Page No.
131 - 135
About Realization of Some Turing Machine is Finite-State and Store
Machines with the Exit
Authors :
N.K. Zarubina
and
V.P. Dobritsa
References
Akho, A. and J. Ullman, 1978. Theory of Parse. Translation and Compilation. Vol. 1, Mir, Moscow, Pages: 613, (In Russian).
Bayrasheva, V.R., 1982. Extents of automatic transformations. Probabilistic Models Cybernetics, 18: 17-25.
Korneeva, N.N., 2011. Extents of asynchronously automatic transformations. Mathematics, 3: 30-40.
Lewis II, P.M. and R.E. Stearns, 1968. Syntax-directed transduction. J. ACM., 15: 465-488.
Direct Link | Meduna, A., 2000. Automata and Languages: Theory and Applications. Springer-Verlag, London, pp: 916.
Rogers, H., 1972. Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York, Pages: 624.
Shutzenberger, M.P., 1963. Context-free languages and pushdown automata. Inform. Control, 6: 246-264.
Sipser, M., 2012. Introduction to the Theory of Computation. 3rd Edn., Cengage Learning, Boston, pp: 458.
Zarubina, N.K., D.N. Zarubina, V.P. Dobritsa and A.A. Nozdrin, 2016. Consecutive automatic shifrator. Series: Management, computer facilities, informatics. Medical instrument making. News of Southwest State University, pp: 36-39.
Zarubina, N.K., V.P. Dobrits and N.S. Ualiyev, 2016. The store automatic machine with an output tape. Series: Management, computer facilities, informatics. Medical instrument making. News of Southwest State University, pp: 52-55.