Hybrid Extended Finite Automata
Extended finite automata are finite state automata equipped with the additional ability to apply an operation on the currently remaining input word, depending on the current state. Hybrid extended finite automata can choose from a finite set of such operations. In this paper, five word operations are taken into consideration which always yield letter-equivalent results, namely reversal and shift operations. The computational power of those machines is investigated, locating the corresponding families of languages in the Chomsky hierarchy. Furthermore, different types of hybrid extended finite automata, defined by the set of operations they are allowed to apply, are compared with each other, demonstrating that there exist dependencies and independencies between the input manipulating operations.
KeywordsRegular Language Finite Automaton Input Symbol State Automaton Language Family
Unable to display preview. Download preview PDF.
- 3.Bordihn, H., Holzer, M., Kutrib, M.: Finite automata with bio-inspired operations: The hairpin inversion operation (unpublished manuscript) (February 2006)Google Scholar
- 4.Chomsky, N.: Handbook of Mathematic Psychology. In: Formal Properties of Grammars, vol. 2, pp. 323–418. Wiley & Sons, New York (1962)Google Scholar
- 5.Evey, R.J.: The Theory and Applications of Pushdown Store Machines. Ph.D thesis, Harvard University, Massachusetts (May 1963)Google Scholar
- 13.Sarkar, P.: Pushdown automaton with the ability to flip its stack. Report TR01-081, Electronic Colloquium on Computational Complexity (ECCC) (November 2001)Google Scholar