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).
|Title of host publication||Descriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Proceedings|
|Editors||Michal Hospodár, Galina Jirásková, Stavros Konstantinidis|
|Number of pages||13|
|Publication status||Published - 2019|
|Event||21st International Conference on Descriptional Complexity of Formal Systems, DCFS 2019 - Košice, Slovakia|
Duration: 2019 Jul 17 → 2019 Jul 19
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||21st International Conference on Descriptional Complexity of Formal Systems, DCFS 2019|
|Period||19/7/17 → 19/7/19|
Bibliographical notePublisher Copyright:
© 2019, IFIP International Federation for Information Processing.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)