Finite automata, formal logic, and circuit complexity
Finite automata, formal logic, and circuit complexity
Regularity and Related Problems for Deterministic Pushdown Automata
Journal of the ACM (JACM)
Journal of the ACM (JACM)
L(A) = L(B)? decidability results from complete formal systems
Theoretical Computer Science
Pushdown processes: games and model-checking
Information and Computation - Special issue on FLOC '96
Efficient minimization of deterministic weak &ohgr;-automata
Information Processing Letters
Validating streaming XML documents
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Symbolic Strategy Synthesis for Games on Pushdown Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Efficient Algorithms for Model Checking Pushdown Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Winning Regions of Pushdown Parity Games: A Saturation Method
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Constant-memory validation of streaming XML documents against DTDs
ICDT'07 Proceedings of the 11th international conference on Database Theory
| Hi-index | 0.00 |
We show that the regularity and equivalence problems are decidable for deterministic weak pushdown ω-automata, giving a partial answer to a question raised by Cohen and Gold in 1978. We prove the decidability by a reduction to the corresponding problems for deterministic pushdown automata on finite words. Furthermore, we consider the problem of deciding for pushdown games whether a winning strategy exists that can be implemented by a finite automaton. We show that this problem is already undecidable for games defined by one-counter automata or visibly pushdown automata with a safety condition.