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 country is fed up with children and their problems. For the first time in history, the differences in outlook between people raising children and those who are not are beginning to assume some political significance. This difference is already a part of the conflicts in local school politics. It may spread to other levels of government. Society has less time for the concerns of those who raise the young or try to teach them.”
—Joseph Featherstone (20th century)