Old Web
English
Sign In
Deterministic pushdown automaton
In automata theory, a deterministic pushdown automaton (DPDA or DPA) is a variation of the pushdown automaton. The class of deterministic pushdown automata accepts the deterministic context-free languages, a proper subset of context-free languages. In automata theory, a deterministic pushdown automaton (DPDA or DPA) is a variation of the pushdown automaton. The class of deterministic pushdown automata accepts the deterministic context-free languages, a proper subset of context-free languages.
Parent Topic
Child Topic
No Parent Topic
Email Address
acemap@cs.sjtu.edu.cn
- CCF Conference Analysis
- Map Galaxy
- Academic Report
- What's New
© Copyright 2015-2020 Acemap, Inc. Shanghai Jiao Tong University.