Descriptional complexity of two-way pushdown automata with restricted head reversals

Two-way nondeterministic pushdown automata (2PDA) are classical nondeterministic pushdown automata (PDA) enhanced with two-way motion of the input head. In this paper, the subclass of 2PDA accepting bounded languages and making at most a constant number of input head turns is studied with respect to descriptional complexity aspects. In particular, the effect of reducing the number of pushdown reversals to a constant number is of interest. It turns out that this reduction leads to an exponential blow-up in case of nondeterministic devices, and to a doubly-exponential blow-up in case of deterministic devices. If the restriction on boundedness of the languages considered and on the finiteness of the number of head and pushdown turns is dropped, the resulting trade-offs are no longer bounded by recursive functions, and so-called non-recursive trade-offs are shown.

[1]  J. Dekker,et al.  Some theorems on classes of recursively enumerable sets , 1958 .

[2]  Carlo Mereghetti,et al.  Converting Two-Way Nondeterministic Unary Automata into Simpler Automata , 2001, MFCS.

[3]  Andreas Malcher,et al.  Descriptional Complexity of Bounded Context-Free Languages , 2007, Developments in Language Theory.

[4]  Burkhard Monien.  Deterministic Two-Way One-Head Pushdown Automata are Very Powerful , 1984, Inf. Process. Lett..

[5]  Marek Chrobak,et al.  Errata to: "finite automata and unary languages" , 2003 .

[6]  Brenda S. Baker,et al.  Reversal-Bounded Multipushdown Machines , 1974, J. Comput. Syst. Sci..

[7]  Ernst L. Leiss,et al.  Succint Representation of Regular Languages by Boolean Automata , 1981, Theor. Comput. Sci..

[8]  Marek Chrobak,et al.  Finite Automata and Unary Languages , 1986, Theor. Comput. Sci..

[9]  Andreas Malcher.  On Recursive and Non-Recursive Trade-Offs Between Finite-Turn Pushdown Automata , 2005, DCFS.

[10]  H. Rice.  Classes of recursively enumerable sets and their decision problems , 1953 .

[11]  Juris Hartmanis.  Context-free languages and turing machine computations , 1967 .

[12]  Kenneth H. Rosen.  Handbook of Discrete and Combinatorial Mathematics , 1999 .

[13]  Carlo Mereghetti,et al.  A Remark on Middle Space Bounded Alternating Turing Machines , 1995, Inf. Process. Lett..

[14]  Juris Hartmanis.  On the Succinctness of Different Representations of Languages , 1980, SIAM J. Comput..

[15]  Carlo Mereghetti,et al.  Optimal Simulations Between Unary Automata , 1998, STACS.

[16]  Martin Kutrib,et al.  Complexity of multi-head finite automata: Origins and directions , 2011, Theor. Comput. Sci..

[17]  Marek Chrobak,et al.  A Note on Bounded-Reversal Multipushdown Machines , 1984, Information Processing Letters.

[18]  Carlo Mereghetti,et al.  More Concise Representation of Regular Languages by Automata and Regular Expressions , 2008, Developments in Language Theory.

[19]  Martin Kutrib,et al.  Descriptional Complexity - An Introductory Survey , 2010, Scientific Applications of Language Methods.

[20]  Andreas Malcher,et al.  Descriptional Complexity of Machines with Limited Resources , 2002, J. Univers. Comput. Sci..

[21]  Michael A. Arbib,et al.  An Introduction to Formal Language Theory , 1988, Texts and Monographs in Computer Science.

[22]  Beatrice Palano,et al.  Behaviours of Unary Quantum Automata , 2010, Fundam. Informaticae.

[23]  Oscar H. Ibarra,et al.  Characterizations of Bounded semilinear Languages by One-Way and Two-Way Deterministic Machines , 2012, Int. J. Found. Comput. Sci..

[24]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[25]  Leslie G. Valiant,et al.  A Note on the Succinctness of Descriptions of Deterministic Languages , 1976, Inf. Control..

[26]  Martin Kutrib,et al.  The Complexity of Regular(-like) Expressions , 2010, Int. J. Found. Comput. Sci..

[27]  Andreas Malcher.  Descriptional Complexity of Cellular Automata and Decidability Questions , 2001, DCFS.

[28]  Tao Jiang,et al.  New Decidability Results Concerning Two-Way Counter Machines , 1995, SIAM J. Comput..

[29]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[30]  Eitan M. Gurari,et al.  Simple Counter Machines and Number-Theoretic Problems , 1979, J. Comput. Syst. Sci..

[31]  A. R. Meyer,et al.  Economy of Description by Automata, Grammars, and Formal Systems , 1971, SWAT.

[32]  Seymour Ginsburg,et al.  The mathematical theory of context free languages , 1966 .

[33]  Oscar H. Ibarra,et al.  A Note on Semilinear Sets and Bounded-Reversal Multihead Pushdown Automata , 1974, Inf. Process. Lett..

[34]  Leslie G. Valiant,et al.  Regularity and Related Problems for Deterministic Pushdown Automata , 1975, JACM.

[35]  Jeffrey Shallit,et al.  Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds , 2002, J. Comput. Syst. Sci..

[36]  Carlo Mereghetti,et al.  The World of Unary Languages: A Quick Tour , 2003, Grammars and Automata for String Processing.

[37]  Eitan M. Gurari,et al.  The Complexity of the Equivalence Problem for two Characterizations of Presburger Sets , 1981, Theor. Comput. Sci..