Decision Procedures for Families of Deterministic Pushdown Automata

Regularity and Related Problems for Deterministic Pushdown Automata

Journal of the ACM (JACM)

Counter-Constrained Finite State Machines: A New Model for Component Protocols with Resource-Dependencies

SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics

The decidability of equivalence for deterministic finite-turn pushdown automata

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing

A decision method for the equivalence of some non-real-time deterministic pushdown automata

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing

An infinite hierarchy of language families resulting from stateless pushdown automata with limited pushdown alphabets

DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems