Some remarks on subclass containment problems for several classes of dpda's
From MaRDI portal
Publication:799387
Recommendations
- Some results on subclass containment problems for special classes of dpda's related to nonsingular machines
- An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs
- On a subclass of DCP
- Subclasses of solvable problems from classes of combinatorial optimization problems
- Subclasses of Presburger arithmetic and the polynomial-time hierarchy
- scientific article; zbMATH DE number 1738657
- Some complexity bounds for subtype inequalities
- Complete problems for space bounded subclasses of NP
- CNF satisfiability in a subspace and related problems
- Subroutines in P systems and closure properties of their complexity classes
Cites work
- A note on non-singular deterministic pushdown automata
- New families of non real time dpda's and their decidability results
- Some negative results concerning DPDA's
- Some results on subclass containment problems for special classes of dpda's related to nonsingular machines
- The equivalence problem for some non-real-time deterministic pushdown automata
Cited in
(6)- On the containment and equivalence problems for GSMs, transducers, and linear CFGs
- The extended equivalence problem for a class of non-real-time deterministic pushdown automata
- Some decision problems concerning NPDAs, palindromes, and Dyck languages
- scientific article; zbMATH DE number 3858445 (Why is no real title available?)
- Some results on subclass containment problems for special classes of dpda's related to nonsingular machines
- New families of non real time dpda's and their decidability results
This page was built for publication: Some remarks on subclass containment problems for several classes of dpda's
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799387)
