Limited Nondeterminism of Input-Driven Pushdown Automata: Decidability and Complexity

Yo Sub Han, Sang Ki Ko, Kai Salomaa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We study the decidability and computational complexity for several decision problems related to limited nondeterminism of finite-state automata equipped with a pushdown stack. Ambiguity and tree width are two measures of nondeterminism considered in the literature. As a main result, we prove that the problem of deciding whether or not the tree width of a nondeterministic pushdown automaton is finite is decidable in polynomial time. We also prove that the k-tree width problem for nondeterministic input-driven pushdown automata (respectively, nondeterministic finite automata) is complete for exponential time (respectively, for polynomial space).

Original languageEnglish
Title of host publicationDescriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Proceedings
EditorsMichal Hospodár, Galina Jirásková, Stavros Konstantinidis
PublisherSpringer Verlag
Pages158-170
Number of pages13
ISBN (Print)9783030232467
DOIs
Publication statusPublished - 2019 Jan 1
Event21st International Conference on Descriptional Complexity of Formal Systems, DCFS 2019 - Košice, Slovakia
Duration: 2019 Jul 172019 Jul 19

Publication series

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

Conference

Conference21st International Conference on Descriptional Complexity of Formal Systems, DCFS 2019
CountrySlovakia
CityKošice
Period19/7/1719/7/19

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Limited Nondeterminism of Input-Driven Pushdown Automata: Decidability and Complexity'. Together they form a unique fingerprint.

  • Cite this

    Han, Y. S., Ko, S. K., & Salomaa, K. (2019). Limited Nondeterminism of Input-Driven Pushdown Automata: Decidability and Complexity. In M. Hospodár, G. Jirásková, & S. Konstantinidis (Eds.), Descriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Proceedings (pp. 158-170). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11612 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-23247-4_12