State Complexity of Operations on Input-Driven Pushdown Automata

The family of deterministic input-driven pushdown automata (IDPDA; a.k.a. visibly pushdown automata, a.k.a. nested word automata) is known to be closed under reversal, concatenation and Kleene star. As shown by Alur and Madhusudan ("Visibly pushdown languages", STOC 2004), the reversal and the Kleene star of an n-state IDPDA can be represented by an IDPDA with 2O(n2) states, while concatenation of an m-state and an n-state IDPDA is represented by an IDPDA with 2O((m+n)2) states. This paper presents more efficient constructions for the reversal and for the Kleene star, which yield 2Θ(n log n) states, as well as an m2Θ(n log n)-state construction for the concatenation. These constructions are optimal due to the previously known matching lower bounds.

[1]  Kai Salomaa,et al.  Operational state complexity of nested word automata , 2008, Theor. Comput. Sci..

[2]  Alexander Okhotin.  Unambiguous Finite Automata over a Unary Alphabet , 2010, MFCS.

[3]  Michael Domaratzki,et al.  State complexity of power , 2009, Theor. Comput. Sci..

[4]  Alexander Okhotin,et al.  Descriptional Complexity of Input-Driven Pushdown Automata , 2012, Languages Alive.

[5]  R. Alur,et al.  Adding nesting structure to words , 2006, JACM.

[6]  Patrick W. Dymond.  Input-Driven Languages are in log n Depth , 1988, Inf. Process. Lett..

[7]  Igor Walukiewicz,et al.  Minimizing Variants of Visibly Pushdown Automata , 2007, MFCS.

[8]  Martin Kutrib,et al.  Nondeterministic Descriptional Complexity Of Regular Languages , 2003, Int. J. Found. Comput. Sci..

[9]  Jean-Camille Birget,et al.  Partial Orders on Words, Minimal Elements of Regular Languages and State Complexity , 1993, Theor. Comput. Sci..

[10]  K. Mehlhorn.  Pebbling Moutain Ranges and its Application of DCFL-Recognition , 1980, ICALP.

[11]  Christof Löding,et al.  Regularity Problems for Visibly Pushdown Languages , 2006, STACS.

[12]  Burchard von Braunmühl,et al.  Input-Driven Languages are Recognized in log n Space , 1983, FCT.

[13]  Mahesh Viswanathan,et al.  Congruences for Visibly Pushdown Languages , 2005, ICALP.

[14]  Joachim Niehren,et al.  Streaming tree automata , 2008, Inf. Process. Lett..

[15]  Kai Salomaa,et al.  Limitations of lower bound methods for deterministic nested word automata , 2011, Inf. Comput..

[16]  Rupak Majumdar,et al.  A Uniformization Theorem for Nested Word to Word Transductions , 2013, CIAA.

[17]  Alexander Okhotin.  Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages , 2011, SOFSEM.

[18]  Alexander Okhotin,et al.  Descriptional Complexity of Unambiguous Nested Word Automata , 2011, LATA.

[19]  Narad Rampersad.  The state complexity of L2 and Lk , 2006, Inf. Process. Lett..

[20]  Stefano Crespi-Reghizzi,et al.  Operator Precedence and the Visibly Pushdown Property , 2010, LATA.

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

[22]  Rajeev Alur,et al.  Visibly pushdown languages , 2004, STOC '04.

[23]  Yo-Sub Han,et al.  Nondeterministic state complexity of nested word automata , 2009, Theor. Comput. Sci..