Descriptional complexity of input-driven pushdown automata

Alexander Okhotin, Xiaoxue Piao, Kai Salomaa

Research outputpeer-review

7 Citations (Scopus)


It is known that a nondeterministic input-driven pushdown automaton (IDPDA) can be determinized. Alur and Madhusudan (Adding nesting structure to words, J.ACM 56(3), 2009) showed that a deterministic IDPDA simulating a nondeterministic IDPDA with n states and stack symbols may need, in the worst case, states. In their construction, the equivalent deterministic IDPDA does, in fact, not need to use the stack. This paper considers the size blow-up of determinization in more detail, and gives a lower bound construction, that is tight within a multiplicative constant, with respect to the size of the nondeterministic automaton both for the number of states and the number of stack symbols. The paper also surveys the recent results on operational state complexity of IDPDAs, and on the cost of converting a nondeterministic automaton to an unambiguous one, and an unambiguous automaton to a deterministic one.

Original languageEnglish
Title of host publicationLanguages Alive
Subtitle of host publicationEssays Dedicated to Jurgen Dassow on the Occasion of His 65th Birthday
EditorsHenning Bordihn, Martin Kutrib, Bianca Truthe
Number of pages21
Publication statusPublished - 8 Oct 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7300 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Descriptional complexity of input-driven pushdown automata'. Together they form a unique fingerprint.

Cite this