[formal language] In mathematics, a local language is a formal language for which membership of a word in the language can be determined by looking at a `window` of length two. Equivalently, it is a language recognised by a local automaton, a class of deterministic finite automaton. More generally, a k-testable language L is one for which m...