A note on non-singular deterministic pushdown automata

DOI10.1016/0304-3975(78)90022-1zbMath0393.68079OpenAlexW2053341755MaRDI QIDQ1252037

Emily P. Friedman

Publication date: 1978

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(78)90022-1

zbMATH Keywords

Nonsingular Deterministic Pushdown Automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items

New families of non real time dpda's and their decidability results ⋮ Some remarks on subclass containment problems for several classes of dpda's ⋮ Some results on subclass containment problems for special classes of dpda's related to nonsingular machines

Cites Work

• A result on the equivalence problem for deterministic pushdown automata
• Optimality of a Two-Phase Strategy for Routing in Interconnection Networks
• Deterministic context free languages