Local Automata
A local automaton is a DFA for which all edges with the same label lead to a single vertex. Local automata accepts the class of local languages, those for which membership of a word in the language is determined by a "sliding window" of length two on the word.
Read more about this topic: Deterministic Finite Automaton
Famous quotes containing the word local:
“The local snivels through the fields:
I sit between felt-hatted mums....”
—Philip Larkin (19221986)
Related Phrases
Related Words