Editing Automata theory (section)

==Variant definitions of automata==
Automata are defined to study useful machines under mathematical formalism. So the definition of an automaton is open to variations according to the "real world machine" that we want to model using the automaton. People have studied many variations of automata. The following are some popular variations in the definition of different components of automata.

;Input
* ''Finite input'': An automaton that accepts only finite sequences of symbols. The above introductory definition only encompasses finite words.
* ''Infinite input'': An automaton that accepts infinite words ([[Omega language|ω-words]]). Such automata are called ''[[omega automaton|ω-automata]]''.
* ''Tree input'': The input may be a ''[[tree (automata theory)|tree of symbols]]'' instead of sequence of symbols. In this case after reading each symbol, the automaton ''reads'' all the successor symbols in the input tree. It is said that the automaton ''makes one copy'' of itself for each successor and each such copy starts running on one of the successor symbols from the state according to the transition relation of the automaton. Such an automaton is called a [[tree automaton]].
* ''Infinite tree input'' : The two extensions above can be combined, so the automaton reads a tree structure with (in)finite branches. Such an automaton is called an [[infinite tree automaton]].

;States
* ''Single state'': An automaton with one state, also called a ''combinational circuit'', performs a transformation which may implement [[combinational logic]].<ref name="structure theory"/>
* ''Finite states'': An automaton that contains only a finite number of states.
* ''Infinite states'': An automaton that may not have a finite number of states, or even a [[countable]] number of states. Different kinds of abstract memory may be used to give such machines finite descriptions.
* ''Stack memory'': An automaton may also contain some extra memory in the form of a [[Stack (abstract data type)|stack]] in which symbols can be pushed and popped. This kind of automaton is called a ''[[pushdown automaton]]''.
* ''Queue memory'': An automaton may have memory in the form of a [[Queue (abstract data type)|queue]]. Such a machine is called ''[[queue machine]]'' and is Turing-complete.
* ''Tape memory'': The inputs and outputs of automata are often described as input and output ''tapes''. Some machines have additional ''working tapes'', including the [[Turing machine]], [[linear bounded automaton]], and [[log-space transducer]].

;Transition function
* ''Deterministic'': For a given current state and an input symbol, if an automaton can only jump to one and only one state then it is a ''[[deterministic automaton]]''.
* ''Nondeterministic'': An automaton that, after reading an input symbol, may jump into any of a number of states, as licensed by its transition relation. The term transition function is replaced by transition relation: The automaton ''non-deterministically'' decides to jump into one of the allowed choices. Such automata are called ''nondeterministic automata''.
* ''Alternation'': This idea is quite similar to tree automata but orthogonal. The automaton may run its ''multiple copies'' on the ''same'' next read symbol. Such automata are called ''[[alternating automaton|alternating automata]]''. The acceptance condition must be satisfied on all runs of such ''copies'' to accept the input.
* ''Two-wayness'': Automata may read their input from left to right, or they may be allowed to move back-and-forth on the input, in a way similar to a [[Turing machine]]. Automata which can move back-and-forth on the input are called [[two-way finite automaton|two-way finite automata]].

;Acceptance condition
* ''Acceptance of finite words'': Same as described in the informal definition above.
* ''Acceptance of infinite words'': an ''ω-automaton'' cannot have final states, as infinite words never terminate. Rather, acceptance of the word is decided by looking at the infinite sequence of visited states during the run.
* ''Probabilistic acceptance'': An automaton need not strictly accept or reject an input. It may accept the input with some [[probability]] between zero and one. For example, [[Quantum finite automaton|quantum finite automata]], [[geometric automata]] and [[metric automata]] have probabilistic acceptance.

Different combinations of the above variations produce many classes of automata.

Automata theory is a subject matter that studies properties of various types of automata. For example, the following questions are studied about a given type of automata.

* Which class of formal languages is recognizable by some type of automata? (Recognizable languages)
* Are certain automata ''closed'' under union, intersection, or complementation of formal languages? (Closure properties)
* How expressive is a type of automata in terms of recognizing a class of formal languages? And, their relative expressive power? (Language hierarchy)

Automata theory also studies the existence or nonexistence of any [[effective method|effective algorithm]]s to solve problems similar to the following list:

* Does an automaton accept at least one input word? (Emptiness checking)
* Is it possible to transform a given non-deterministic automaton into a deterministic automaton without changing the language recognized? (Determinization)
* For a given formal language, what is the smallest automaton that recognizes it? ([[DFA minimization|Minimization]])