Page "Automata theory" Paragraph 26
from
Wikipedia
: An automaton can recognize a formal language.
The language L ⊆ Σ * recognized by an automaton is the set of all the words that are accepted by the automaton.
Page 1 of 1.
2.016 seconds.