@inproceedings{6260567709a74de0bc3fec8ec5bb2480,
title = "Limited Nondeterminism of Input-Driven Pushdown Automata: Decidability and Complexity",
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).",
keywords = "Ambiguity, Input-driven pushdown automata, Nondeterminism, Tree width",
author = "Han, {Yo Sub} and Ko, {Sang Ki} and Kai Salomaa",
note = "Publisher Copyright: {\textcopyright} 2019, IFIP International Federation for Information Processing.; 21st International Conference on Descriptional Complexity of Formal Systems, DCFS 2019 ; Conference date: 17-07-2019 Through 19-07-2019",
year = "2019",
doi = "10.1007/978-3-030-23247-4_12",
language = "English",
isbn = "9783030232467",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "158--170",
editor = "Michal Hospod{\'a}r and Galina Jir{\'a}skov{\'a} and Stavros Konstantinidis",
booktitle = "Descriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Proceedings",
address = "Germany",
}