Deterministic Finite Automaton - Local Automata

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:

    Civility, which is a disposition to accommodate and oblige others, is essentially the same in every country; but good breeding, as it is called, which is the manner of exerting that disposition, is different in almost every country, and merely local; and every man of sense imitates and conforms to that local good breeding of the place which he is at.
    Philip Dormer Stanhope, 4th Earl Chesterfield (1694–1773)