Limited Automata: Properties, Complexity and Variants
- 191 Downloads
Limited automata are single-tape Turing machines with severe rewriting restrictions. They have been introduced in 1967 by Thomas Hibbard, who proved that they have the same computational power as pushdown automata. Hence, they provide an alternative characterization of the class of context-free languages in terms of recognizing devices. After that paper, these models have been almost forgotten for many years. Only recently limited automata were reconsidered in a series of papers, where several properties of them and of their variants have been investigated. In this work we present an overview of the most important results obtained in these researches. We also discuss some related models and possible lines for future investigations.
I am very grateful to Luca Prigioniero for his valuable and helpful comments.
- 2.Chomsky, N., Schützenberger, M.: The algebraic theory of context-free languages. In: Braffort, P., Hirschberg, D. (eds.) Computer Programming and Formal Systems, Studies in Logic and the Foundations of Mathematics, vol. 35, pp. 118–161. Elsevier (1963). https://doi.org/10.1016/S0049-237X(08)72023-8
- 6.Guillon, B., Prigioniero, L.: Linear-time limited automata. Theoret. Comput. Sci. (2019, in press). https://doi.org/10.1016/j.tcs.2019.03.037
- 31.Sakoda, W.J., Sipser, M.: Nondeterminism and the size of two way finite automata. In: Lipton, R.J., Burkhard, W.A., Savitch, W.J., Friedman, E.P., Aho, A.V. (eds.) Proceedings 10th Annual ACM Symposium on Theory of Computing (STOC 1978), pp. 275–286. ACM (1978). https://doi.org/10.1145/800133.804357
- 33.Sloane, N.J.A.: The on-line encyclopedia of integer sequences. http://oeis.org/A007814