MONA is a tool that translates formulas to finite-state automata.
The formulas may express search patterns, temporal properties
of reactive systems, parse tree constraints, etc. MONA analyses
the automaton resulting from the compilation and prints out "valid" or a
counter-example
