Boolean language operations on nondeterministic automata with a pushdown of constant height

We study the size-cost of Boolean operations on constant height nondeterministic pushdown automata, i.e. on pushdown automata with a constant limit on the size of the pushdown. For intersection, we show an exponential simulation and prove that the exponential blow-up is necessary. For union, instead, we provide a linear trade-off while, for complement, we show a double-exponential simulation and prove a single-exponential lower bound.

[1]  Tobias Mömke,et al.  Size complexity of rotating and sweeping automata , 2012, J. Comput. Syst. Sci..

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

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

[4]  Shou-Feng Wang,et al.  𝒫𝒮-regular languages , 2011, Int. J. Comput. Math..

[5]  Carlo Mereghetti,et al.  Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height , 2013, CSR.

[6]  Alberto Bertoni,et al.  Golomb Rulers And Difference Sets For Succinct Quantum Automata , 2003, Int. J. Found. Comput. Sci..

[7]  William J. Sakoda,et al.  Nondeterminism and the size of two way finite automata , 1978, STOC.

[8]  Carlo Mereghetti,et al.  Removing nondeterminism in constant height pushdown automata , 2012, Inf. Comput..

[9]  Zuzana Bednárová,et al.  Two Double-Exponential Gaps for Automata with a Limited Pushdown , 2014, LATA.

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

[11]  Markus Holzer,et al.  Language Operations with Regular Expressions of Polynomial Size , 2008, DCFS.

[12]  Katja Meckel,et al.  Queue Automata of Constant Length , 2013, DCFS.

[13]  Sheng Yu,et al.  The State Complexities of Some Basic Operations on Regular Languages , 1994, Theor. Comput. Sci..

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

[15]  Radu Gramatovici.  Bounded Deterministic Push-Down Automata , 2000, Recent Topics in Mathematical and Computational Linguistics.

[16]  Florin Manea,et al.  Syllabic Languages and Go-through Automata , 2014, Fundam. Informaticae.

[17]  Andrzej Ehrenfeucht,et al.  Complexity measures for regular expressions , 1974, STOC '74.

[18]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[19]  Martin Kutrib,et al.  Deterministic input-driven queue automata: Finite turns, decidability, and closure properties , 2015, Theor. Comput. Sci..

[20]  Jeffrey Shallit,et al.  Unary Language Operations, State Complexity and Jacobsthal's Function , 2002, Int. J. Found. Comput. Sci..

[21]  Carlo Mereghetti,et al.  The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata , 2011, DCFS.

[22]  Andreas Malcher,et al.  Descriptional complexity of two-way pushdown automata with restricted head reversals , 2011, Theor. Comput. Sci..

[23]  Michael Sipser.  Lower Bounds on the Size of Sweeping Automata , 1980, J. Comput. Syst. Sci..

[24]  Jean-Camille Birget.  Positional Simulation of Two-Way Automata: Proof of a Conjecture of R. Kannan and Generalizations , 1992, J. Comput. Syst. Sci..

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

[26]  Christos A. Kapoutsis.  Removing Bidirectionality from Nondeterministic Finite Automata , 2005, MFCS.

[27]  Giovanni Pighizzini,et al.  Two-way unary automata versus logarithmic space , 2011, Inf. Comput..

[28]  Martin Kutrib,et al.  The Boolean Closure of Linear Context-Free Languages , 2004, Developments in Language Theory.

[29]  Carlo Mereghetti,et al.  Complexity of Promise Problems on Classical and Quantum Automata , 2014, Computing with New Resources.

[30]  Carlo Mereghetti,et al.  On the Size of Unary Probabilistic and Nondeterministic Automata , 2011, Fundam. Informaticae.

[31]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .