Input: A regular expression possibly with standard boolean operaters, character classes and strings for the regular expression in unix-like syntax.
Output: An automaton.
Input-output relation: The output is a minimum automata for the input regular expression among the bisimulation equivalences.
Features: Boolean operations on the intervals of charaters are suppored to compute a set of mutual disjoint partition for the character classes in the input regular expression.
To run the CGI: Put a regular expression into the input box, and push the button，In stead of writing, you may select a regular expression from the prepared sample expressions.
| [], "" | empty string |
| a character | itself |
| char(...) | character class boolean expression |
| "...." | regular expression in string |
| _ | _ | union |
| _ & _ | meet |
| _ \ _ | set minus |
| \(_) | set complement |
| _ + _ | string concatenation |
| *( _ ) | Kleene closure |
| rev( _ ) | reverse |
| E^N | EE...E (N times) |
| E<N | EE...E (less than N times) |