 Similarly, the matrices could be taken as automorphisms of a homogeneous space; this defines a geometric finite automaton.Before moving on to the formal description of a QFA, there are two noteworthy generalizations that should be mentioned and understood.The first is the non-deterministic finite automaton (NFA).