On sparseness, ambiguity and other decision problems for acceptors and transducers
3rd annual symposium on theoretical aspects of computer science on STACS 86
String-rewriting systems
An Infinite Hierarchy of Context-Free Languages
Journal of the ACM (JACM)
Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM (JACM)
Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem
Journal of the ACM (JACM)
Complete formal systems for equivalence problems
Theoretical Computer Science - Special issue on universal machines and computations
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Deciding DPDA Equivalence Is Primitive Recursive
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Computational parallels between the regular and context-free languages
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Word Problems and Membership Problems on Compressed Words
SIAM Journal on Computing
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
The Inclusion Problem of Context-Free Languages: Some Tractable Cases
DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
Descriptional complexity of bounded context-free languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
On the containment and equivalence problems for two-way transducers
Theoretical Computer Science
Hi-index | 0.00 |
We address several types of decision questions related to context-free languages when an NPDA is given as input. First we consider the question of whether the NPDA makes a bounded number of stack reversals (over all accepting inputs) and show that this problem is undecidable even when the NPDA is only 2-ambiguous. We consider the same problem for counter machines (i.e., whether the counter makes a bounded number of reversals) and show that it is also undecidable. On the other hand, we show that the problem is decidable for unambiguous NPDAs even when augmented with reversal-bounded counters. Next, we look at problems of equivalence, containment and disjointness with fixed languages. With the fixed language L0 being one of the following: P = $\{ x \# x^r \ | $x∈(0+1)* }, Pu = $\{ x x^r \ | $x∈(0+1)* }, Dk = Dyck language with k-type of parentheses, or Sk = two-sided Dyck language with k types of parentheses, we consider problems such as: 'Is L(M)∩L0 = ∅?', 'Is L(M)⊆L0?', or 'Is L(M) = L0?', where M is an input NPDA (or a restricted form of it). For example, we show that the problem, 'Is L(M)∩P?', is undecidable when M is a deterministic one-counter acceptor, while the problem 'Is L(M)⊆P?' is decidable even for NPDAs augmented with reversal-bounded counters. Another result is that the problem 'Is L(M)⊆Pu?' is decidable in polynomial time for M an NPDA. We also show several other related decidability and undecidability results.