Abstract
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 2O(n2) with 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 m 2 Θ(n log n)-state construction for the concatenation. These constructions are optimal due to the previously known matching lower bounds. © 2011 Springer-Verlag GmbH.
Cite
CITATION STYLE
Okhotin, A., & Salomaa, K. (2011). State complexity of operations on input-driven pushdown automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6907 LNCS, pp. 485–496). https://doi.org/10.1007/978-3-642-22993-0_44
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
