A note on non-singular deterministic pushdown automata

DOI10.1016/0304-3975(78)90022-1MaRDI QIDQ1252037zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

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

Cited in

(3)

• 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

This page was built for publication: A note on non-singular deterministic pushdown automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1252037)