;;; Example of a simple FSA.
;;;
;;; This FSA recognizes the language  {a^n | n is odd}


(setf *fsa*
 '((Alphabet      (a))
   (States        (q0 q1))
   (Initial       q0)
   (Final         (q0))
   (Transitions
                  (((q0 a) q1)
                   ((q1 a) q0)))))