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
EditorsStavros Konstantinidis, Michal Hospodár, Galina Jirásková
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

Fingerprint

Computability and decidability
Pushdown Automata
Treewidth
Nondeterminism
Finite automata
Decidability
Polynomials
K-tree
Finite State Automata
Exponential time
Finite Automata
Decision problem
Computational complexity
Polynomial time
Computational Complexity
Polynomial

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Han, Y-S., Ko, S. K., & Salomaa, K. (2019). Limited Nondeterminism of Input-Driven Pushdown Automata: Decidability and Complexity. In S. Konstantinidis, M. Hospodár, & G. Jirásková (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
Han, Yo-Sub ; Ko, Sang Ki ; Salomaa, Kai. / Limited Nondeterminism of Input-Driven Pushdown Automata : Decidability and Complexity. Descriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Proceedings. editor / Stavros Konstantinidis ; Michal Hospodár ; Galina Jirásková. Springer Verlag, 2019. pp. 158-170 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{9ef5a56475a34dd1a29b4f001f6dc07c,
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).",
author = "Yo-Sub Han and Ko, {Sang Ki} and Kai Salomaa",
year = "2019",
month = "1",
day = "1",
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 = "Stavros Konstantinidis and Michal Hospod{\'a}r and Galina Jir{\'a}skov{\'a}",
booktitle = "Descriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Proceedings",
address = "Germany",

}

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

Limited Nondeterminism of Input-Driven Pushdown Automata : Decidability and Complexity. / Han, Yo-Sub; Ko, Sang Ki; Salomaa, Kai.

Descriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Proceedings. ed. / Stavros Konstantinidis; Michal Hospodár; Galina Jirásková. Springer Verlag, 2019. p. 158-170 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11612 LNCS).

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

TY - GEN

T1 - Limited Nondeterminism of Input-Driven Pushdown Automata

T2 - Decidability and Complexity

AU - Han, Yo-Sub

AU - Ko, Sang Ki

AU - Salomaa, Kai

PY - 2019/1/1

Y1 - 2019/1/1

N2 - 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).

AB - 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).

UR - http://www.scopus.com/inward/record.url?scp=85069543333&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85069543333&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-23247-4_12

DO - 10.1007/978-3-030-23247-4_12

M3 - Conference contribution

AN - SCOPUS:85069543333

SN - 9783030232467

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 158

EP - 170

BT - Descriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Proceedings

A2 - Konstantinidis, Stavros

A2 - Hospodár, Michal

A2 - Jirásková, Galina

PB - Springer Verlag

ER -

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