Compact normal form for regular languages as xor automata

Abstract

The only presently known normal form for a regular language is its Minimal Deterministic Automaton . We show that a regular language is also characterized by a finite dimension , which is always smaller than the number of states, and often exponentially so. The dimension is also the minimal number of states of all Nondeterministic Xor Automaton (NXA) which accept the language. NXAs combine the advantages of deterministic automata (normal form, negation, minimization, equivalence of states, accessibility) and of nondeterministic ones (compactness, mirror language). We present an algorithmic construction of the Minimal Non Deterministic Xor Automaton , in cubic time from any NXA for . The MXA provides another normal form: . Our algorithm establishes a missing connection between Brzozowski's mirror-based minimization method for deterministic automata, and algorithms based on state-equivalence. © 2009 Springer Berlin Heidelberg.