Xerox Finite-State Compiler

XEROX FINITE-STATE COMPILER

This page allows you to create a finite-state network from a regular expression and to apply the resulting network to strings. You can also try out some of our Examples.

COMPILATION :

Type a regular expression in this area and submit it to the compiler by pressing the SUBMIT button. The compilation result will appear in a new browser window. Clear with RESET.

.

Display the structure of the network (if it has not more than 50 states).

DOWNWARD APPLICATION :

Type upper-side strings (one per line) in this area to see the corresponding lower-side strings.

UPWARD APPLICATION :

Type lower-side strings (one per line) in this area to see the corresponding upper-side strings.

The compilation time depends on the complexity of the expression. Execution will automatically be stopped after 3 minutes. The resulting network will be epsilonfree, deterministic and minimal (see explanation of network properties).

For more detailed information please look at our published articles, technical reports, and pointers to finite-state literature.

The Xerox Finite-State Compiler was created by Tamás Gaál, Ronald M. Kaplan, Lauri Karttunen, André Kempe. We hope that it will be useful as a teaching aid.

We welcome comments and questions.

Back to Finite State Technology homepage