Abstract
Input-reversal pushdown automata are pushdown automata with the additional power to reverse the unread part of the input. We show that these machines characterize the family of linear context-free indexed languages, and that k + 1 input reversals are better than k for both deterministic and nondeterministic input-reversal pushdown automata, i.e., there are languages which can be recognized by a deterministic input-reversal pushdown automaton with k + 1 input reversals but which cannot be recognized with k input reversals (deterministic or nondeterministic). In passing, input-reversal finite automata are investigated. Moreover, an inherent relation between input-reversal pushdown automata and controlled linear context-free languages are shown, leading to an alternative description of Khabbaz geometric hierarchy of languages by input-reversal iterated pushdown automata. Finally, some computational complexity problems for the investigated language families are considered.
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. Journal of the ACM 15(4), 647–671 (1968)
Aho, A.V.: Nested stack automata. Journal of the ACM 16(3), 383–406 (1969)
Bader, Ch., Moura, A.: A generalization of Ogden’s lemma. Journal of the ACM 29(2), 404–407 (1982)
Balcázar, J.L., Díaz, J., Gabarró, J.: Structural Complexity I. In: EATCS Monographs on Theoretical Computer Science, vol. 11, Springer, Heidelberg (1988)
Borodin, A., Cook, S.A., Dymond, P.W., Ruzzo, W.L., Tompa, M.: Erratum: Two applications of inductive counting for complementation problems. SIAM Journal on Computing 18(6), 1283 (1989)
Borodin, A., Cook, S.A., Dymond, P.W., Ruzzo, W.L., Tompa, M.: Two applications of inductive counting for complementation problems. SIAM Journal on Computing 18(3), 559–578 (1989)
Duske, J., Parchmann, R.: Linear indexed languages. Theoretical Computer Science 32(1–2), 47–60 (1984)
Ginsburg, S.: Algebraic and Automata-Theoretic Properties of Formal Languages. North-Holland, Amsterdam (1975)
Ginsburg, S., Spanier, E.H.: Cotrol sets on grammars. Mathematical Systems Theory 2(2), 159–177 (1968)
Greibach, S.A.: One way finite visit automata. Theoretical Computer Science 6(2), 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)
Immerman, N.: Nondeterministic space is closed under complementation. SIAM Journal on Computing 17(5), 935–938 (1988)
Khabbaz, N.A.: Control sets and linear grammars. Information and Control 25(3), 206–221 (1974)
Khabbaz, N.A.: A geometric hierarchy of languages. Journal of Computer and System Sciences 8(2), 142–157 (1974)
Ruzzo, W.L., Simon, J., Tompa, M.: Space-bounded hierarchies and probabilistic computations. Journal of Computer and System Sciences 28(2), 216–230 (1984)
Sarkar, P.: Pushdown automaton with the ability to flip its stack. In: Report TR01-081, Electronic Colloquium on Computational Complexity (ECCC) (November 2001)
Sudborough, I.H.: A note on tape-bounded complexity classes and linear context-free languages. Journal of the ACM 22(4), 499–500 (1975)
Sudborough, I.H.: On the tape complexity of deterministic context-free languages. Journal of the ACM 25(3), 405–414 (1978)
Szelepcsényi, R.: The method of forced enumeration for nondeterministic automata. Acta Informatica 26(3), 279–284 (1988)
Vogler, H.: Iterated linear control and iterated one-turn pushdowns. Mathematical Systems Theory 19(2), 117–133 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bordihn, H., Holzer, M., Kutrib, M. (2004). 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) Developments in Language Theory. DLT 2004. Lecture Notes in Computer Science, vol 3340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30550-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-30550-7_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24014-3
Online ISBN: 978-3-540-30550-7
eBook Packages: Computer ScienceComputer Science (R0)