XEROX FINITE-STATE COMPILER

The Xerox Finite-State Compiler allows you to enter a regular expression in a text window and compile it into a finite-state network. Depending on the expression you type, the result is either a simple automaton or a transducer.

You can test out the result by applying it to one or more input strings. If the network is a transducer, you first choose the direction of application (upwards or downwards). For simple automata, the direction makes no difference. The output from the application is shown in another window. If the network is small (<= 50 states), you can also have the states and arcs of the network displayed.

If you just want to try out some simple examples, start here ; if you are ready to spend more time, go to the ordinary input page .

In the latter case, unless you are already familiar with the Xerox regular-expression compiler, we recommend that you start by reading some of our documentation (for the time being, only in English):

Syntax and Semantics of Regular Expressions
Finite-State Networks
Application of Finite-State Networks
Examples of Networks and Regular Expressions
Literature References

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