Editing Deterministic finite automaton (section)

===Local automata===

A '''local automaton''' is a DFA, not necessarily complete, for which all edges with the same label lead to a single vertex.  Local automata accept the class of [[Local language (formal language)|local languages]], those for which membership of a word in the language is determined by a "sliding window" of length two on the word.{{sfn|Lawson|2004|p=129}}{{sfn|Sakarovitch|2009|p=228}}

A '''Myhill graph''' over an alphabet ''A'' is a [[directed graph]] with [[Vertex (graph theory)|vertex set]] ''A'' and subsets of vertices labelled "start" and "finish".  The language accepted by a Myhill graph is the set of directed paths from a start vertex to a finish vertex: the graph thus acts as an automaton.{{sfn|Lawson|2004|p=129}} The class of languages accepted by Myhill graphs is the class of local languages.{{sfn|Lawson|2004| p=128}}