Descriptional complexity of unambiguous input-driven pushdown automata

Alexander Okhotin, Kai Salomaa

Research output

12 Citations (Scopus)

Abstract

It is known that a nondeterministic input-driven pushdown automaton (IDPDA) (a.k.a. visibly pushdown automaton; a.k.a. nested word automaton) with n states can be transformed to an equivalent deterministic automaton with 2Θ(n2) states (B. von Braunmühl and R. Verbeek, 1983 [8]), and that this size is necessary in the worst case (R. Alur and P. Madhusudan, 2009 [4]). This paper demonstrates that the same worst-case 2Θ(n2) size blow-up occurs when converting a nondeterministic IDPDA to an unambiguous one, and an unambiguous IDPDA to a deterministic one. In addition, the methods developed in this paper are used to demonstrate that the descriptional complexity of complementation for nondeterministic IDPDAs is 2Θ(n2), and that the descriptional complexity of homomorphisms for deterministic IDPDAs is 2Θ(n2).

Original languageEnglish
Pages (from-to)1-11
Number of pages11
JournalTheoretical Computer Science
Volume566
Issue numberC
DOIs
Publication statusPublished - 1 Jan 2015

    Fingerprint

Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this