Revolving-Input Finite Automata
We introduce and investigate revolving-input finite automata, which are nondeterministic finite automata with the additional ability to shift the remaining part of the input. We consider three different modes of shifting, namely revolving to the left, revolving to the right, and circular interchanging. We show that the latter operation does not increase the computational power of finite automata, even if the number of revolving operations is unbounded. The same result is obtained for the former two operations in case of an arbitrary but constant number of applications allowed. An unbounded number of these operations leads to language families that are properly contained in the family of context-sensitive languages, are incomparable with the family of context-free languages, and are strictly more powerful than regular languages. Moreover, we show that right revolving can be simulated by left revolving, when considering the mirror image of the input.
KeywordsRegular Language Finite Automaton Language Family Pigeon Hole Principle Unbounded Number
Unable to display preview. Download preview PDF.
- 2.Chomsky, N.: Formal Properties of Grammars. In: Handbook of Mathematic Psychology, vol. 2, pp. 323–418. Wiley & Sons, New York (1962)Google Scholar
- 3.Evey, R.J.: The Theory and Applications of Pushdown Store Machines. Ph.D thesis, Harvard University, Massachusetts (1963)Google Scholar
- 11.Sarkar, P.: Pushdown automaton with the ability to flip its stack. Report TR01-081, Electronic Colloquium on Computational Complexity, ECCC (2001)Google Scholar