下推自动机 Pushdown automaton
（重定向自Stack automaton）
在自动机理论中，下推自动机（Pushdown automaton）是使用了包含数据的栈的有限自动机。
Stack automaton
中文百科
英语百科
Pushdown automaton 下推自动机
（重定向自Stack automaton）
![Automata theory.svg](/Images/godic/202502/12/Automata_theory.svg3618.png")
![A diagram of the pushdown automaton](/Images/godic/202502/12/Pushdown-overview.svg3618.png")
![a step of the pushdown automaton](/Images/godic/202502/12/Pushdown-step.svg3618.png")
![Teoría de autómatas.svg](/Images/godic/202502/12/Teoría_de_autómatas.svg3618.png")
In computer science, a pushdown automaton (PDA) is a type of automaton that employs a stack.
Pushdown automata are used in theories about what can be computed by machines. They are more capable than finite-state machines but less capable than Turing machines. Deterministic pushdown automata can recognize all deterministic context-free languages while nondeterministic ones can recognize all context-free languages. Mainly the former are used in parser design.
- breaking wind speed
- breaking with
- breaking work
- breaking zone
- break in invert
- breakin keying
- breakin oil
- break in oil
- break in on
- breakin operate time
- break in operation
- break in period
- breakin period
- breakinperiod
- break in pieces
- break in point
- break in relay
- break in run
- breakin run
- breakins
- break in
- break in scuffing
- break in sedimentation
- breakin system
- break in the arrow