This page lists state machine libraries.
All regular expression library implements an automaton.
We list a couple of example.
http://www.brics.dk/automaton/ : Finite-state automaton for regular expressions.
This package uses deterministic finite-state automata (DFA), unlike most other regexp-packages that are based on nondeterministic automata (NFA). This means:
Example:
RegExp r = new RegExp("ab(c|d)*");
Automaton a = r.toAutomaton();
String s = "abcccdc";
System.out.println("Match: " + a.run(s)); // prints: true
multiregexp based on automaton
stateless 1) Create state machines and lightweight state machine-based workflows directly in java code.