Abstract
We summarize results on extended finite automata, which are basically finite state machines with the additional ability to manipulate the still unread part of the input. Well-known manipulation functions are reversal, left-revolving, right-revolving, and circular interchanging, or even biologically motivated functions as hairpin inversion. We mainly focus on the computational power of these machines and on the closure properties by standard formal language operations of the induced language families. Moreover, we also discuss several generalizations of this concept, the natural generalization to hybrid extended finite automata, which allows several input manipulation functions, and in particular, extended pushdown automata, which lead to an alternative characterization of Khabbaz hierarchy of languages. We do not prove these results but we merely draw attention to the big picture, some of the main ideas involved, and open problems for further research.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V.: Indexed grammars—An extension of context-free grammars. J. ACM 15, 647–671 (1968)
Aho, A.V.: Nested stack automata. J. ACM 16, 383–406 (1969)
Bader, C., Moura, A.: A generalization of Ogden’s lemma. J. ACM 29, 404–407 (1982)
Bensch, S., Bordihn, H., Holzer, M., Kutrib, M.: Deterministic input-reversal and input-revolving finite automata. In: Martín-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 113–124. Springer, Heidelberg (2008)
Bensch, S., Bordihn, H., Holzer, M., Kutrib, M.: On input-revolving deterministic and nondeterministic finite automata. Inform. Comput. 207, 1140–1155 (2009)
Bordihn, H., Holzer, M., Kutrib, M.: Input reversals and iterated pushdown automata: A new characterization of khabbaz geometric hierarchy of languages. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 102–113. Springer, Heidelberg (2004)
Bordihn, H., Holzer, M., Kutrib, M.: Revolving-input finite automata. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol. 3572, pp. 168–179. Springer, Heidelberg (2005)
Bordihn, H., Holzer, M., Kutrib, M.: Hairpin finite automata. In: Harju, T., Karhumäki, J., Lepistö, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 108–119. Springer, Heidelberg (2007)
Bordihn, H., Holzer, M., Kutrib, M.: Hybrid extended finite automata. Internat. J. Found. Comput. Sci. 18, 745–760 (2007)
Chomsky, N.: Formal Properties of Grammars. In: Handbook of Mathematic Psychology, vol. 2, pp. 323–418. Wiley & Sons, Chichester (1962)
Culy, C.: Formal properties of natural language and linguistic theories. Linguistics and Philosophy 19, 599–617 (1996)
Daley, M., Ibarra, O., Kari, L.: Closure properties and decision questions of some language classes under ciliate bio-operations. Theoret. Comput. Sci. 306, 19–38 (2003)
Daley, M., Kari, L., McQuillan, I.: Families of languages defined by ciliate bio-operations. Theoret. Comput. Sci. 320, 51–69 (2004)
Dassow, J., Holzer, M.: Language families defined by a ciliate bio-operation: Hierarchies and decision problems. Internat. J. Found. Comput. Sci. 16, 645–662 (2005)
Dassow, J., Mitrana, V., Salomaa, A.: Operations and language generating devices suggested by genome evlution. Theoret. Comput. Sci. 270, 701–738 (2002)
Dassow, J., Păun, G.: Remarks on operations suggested by mutations in genomes. Fund. Inform. 36, 183–200 (1998)
Duske, J., Parchmann, R.: Linear indexed languages. Theoret. Comput. Sci. 32, 47–60 (1984)
Ginsburg, S.: Algebraic and Automata-Theoretic Properties of Formal Languages. North-Holland, Amsterdam (1975)
Ginsburg, S., Greibach, S.A., Harrison, M.A.: One-way stack automata. J. ACM 14, 389–418 (1967)
Greibach, S.A.: One way finite visit automata. Theoret. Comput. Sci. 6, 175–221 (1978)
Holzer, M., Kutrib, M.: Flip-pushdown automata: k + 1 pushdown reversals are better than k. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 490–501. Springer, Heidelberg (2003)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)
Khabbaz, N.A.: Control sets and linear grammars. Inform. Control 25, 206–221 (1974)
Khabbaz, N.A.: A geometric hierarchy of languages. J. Comput. System Sci. 8, 142–157 (1974)
Kuroda, S.Y.: Classes of languages and linear bounded automata. Inform. Control 7, 207–223 (1964)
Salomaa, A.: Formal Languages. Academic Press, New York (1973)
Sarkar, P.: Pushdown automaton with the ability to flip its stack. Report TR01-081,ECCC (2001)
Vogler, H.: Iterated linear control and iterated one-turn pushdowns. Math. Systems Theory 19, 117–133 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Holzer, M., Kutrib, M. (2011). Gaining Power by Input Operations: Finite Automata and Beyond. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, JM., Maurel, D. (eds) Implementation and Application of Automata. CIAA 2011. Lecture Notes in Computer Science, vol 6807. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22256-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-22256-6_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22255-9
Online ISBN: 978-3-642-22256-6
eBook Packages: Computer ScienceComputer Science (R0)