View in EDS

Deciding path size of nondeterministic (and input-driven) pushdown automata.

Saved in:
Bibliographic Details
Title: Deciding path size of nondeterministic (and input-driven) pushdown automata.
Authors: Han, Yo-Sub1 (AUTHOR) emmous@yonsei.ac.kr, Ko, Sang-Ki1,2 (AUTHOR) sangkiko@kangwon.ac.kr, Salomaa, Kai1,3 (AUTHOR) ksalomaa@cs.queensu.ca
Source: Theoretical Computer Science. Jan2023, Vol. 939, p170-181. 12p.
Subjects: Polynomial time algorithms, Finite state machines, Decision making, Robots
Abstract: The degree of ambiguity (respectively, the path size) of a nondeterministic automaton, on a given input, measures the number of accepting computations (respectively, the number of all computations). It is known that deciding the finiteness of the degree of ambiguity of a nondeterministic pushdown automaton is undecidable. Also, it is undecidable for a given k ≥ 3 to decide whether the path size of a nondeterministic pushdown automaton is bounded by k. As the main result, we show that deciding the finiteness of the path size of a nondeterministic pushdown automaton can be done in polynomial time. Also, we show that the k -path problem for nondeterministic input-driven pushdown automata (respectively, for nondeterministic finite automata) is complete for exponential time (respectively, complete for polynomial space). • We show that finiteness of path size of nondeterministic pushdown automata can be solved in polynomial time. • We show that deciding k-path property is PSPACE complete for nondeterministic finite automata. • We show that deciding k-path property is exponential time complete for nondeterministic input-driven pushdown automata. [ABSTRACT FROM AUTHOR]
Copyright of Theoretical Computer Science is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:The degree of ambiguity (respectively, the path size) of a nondeterministic automaton, on a given input, measures the number of accepting computations (respectively, the number of all computations). It is known that deciding the finiteness of the degree of ambiguity of a nondeterministic pushdown automaton is undecidable. Also, it is undecidable for a given k ≥ 3 to decide whether the path size of a nondeterministic pushdown automaton is bounded by k. As the main result, we show that deciding the finiteness of the path size of a nondeterministic pushdown automaton can be done in polynomial time. Also, we show that the k -path problem for nondeterministic input-driven pushdown automata (respectively, for nondeterministic finite automata) is complete for exponential time (respectively, complete for polynomial space). • We show that finiteness of path size of nondeterministic pushdown automata can be solved in polynomial time. • We show that deciding k-path property is PSPACE complete for nondeterministic finite automata. • We show that deciding k-path property is exponential time complete for nondeterministic input-driven pushdown automata. [ABSTRACT FROM AUTHOR]
ISSN:03043975
DOI:10.1016/j.tcs.2022.10.023