this turns a regexp over A into a NondetWorkAutom over A using the celebrated position automata construction (also called Berry-Sethi or Glushkov)
A deterministic automaton .
A fast test of language inclusion between minimal automata .
A nondeterministic automaton .
This class turns a regexp into a NondetWordAutom using the celebrated position automata construction (also called Berry-Sethi or Glushkov)