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:

    Reporters for tabloid newspapers beat a path to the park entrance each summer when the national convention of nudists is held, but the cult’s requirement that visitors disrobe is an obstacle to complete coverage of nudist news. Local residents interested in the nudist movement but as yet unwilling to affiliate make observations from rowboats in Great Egg Harbor River.
    —For the State of New Jersey, U.S. public relief program (1935-1943)