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:

    While it may not heighten our sympathy, wit widens our horizons by its flashes, revealing remote hidden affiliations and drawing laughter from far afield; humor, in contrast, strikes up fellow feeling, and though it does not leap so much across time and space, enriches our insight into the universal in familiar things, lending it a local habitation and a name.
    —Marie Collins Swabey. Comic Laughter, ch. 5, Yale University Press (1961)