Editing Automata theory (section)

== Types of automata ==
The following is an incomplete list of types of automata.

{| class="wikitable"
|-
! Automaton
! Recognizable languages
|-
|[[Finite-state machine|Nondeterministic/Deterministic finite-state machine]] (FSM)
|[[regular language]]s
|-
| [[Deterministic pushdown automaton]] (DPDA)
| [[deterministic context-free language]]s
|-
| [[Pushdown automaton]] (PDA)
| [[context-free language]]s
|-
| [[Linear bounded automaton]] (LBA)
| [[context-sensitive language]]s
|-
| [[Turing machine]]
| [[recursively enumerable language]]s
|-
| Deterministic [[Büchi automaton]]
| [[Omega language#Operations|ω-limit languages]]
|-
| Nondeterministic Büchi automaton
| rowspan="2" | [[Omega-regular language|ω-regular languages]]
|-
| [[Rabin automaton]], [[Streett automaton]], [[Parity automaton]], [[Muller automaton]]
|-
| [[Weighted automaton]]
|
|-
|}

===Discrete, continuous, and hybrid automata===
Normally automata theory describes the states of abstract machines but there are discrete automata, [[analog automata]] or [[continuous automaton|continuous automata]], or [[Hybrid automaton|hybrid discrete-continuous automata]], which use digital data, analog data or continuous time, or digital ''and'' analog data, respectively.