Xerox Finite-State Compiler

XEROX FINITE-STATE COMPILER

COMPILATION :

Type a regular expression in this area. When you are done, hit the SUBMIT button below. To get you started, there is a simple example in the window already for you to try. It compiles to a transducer that associates a couple of animals with the sound they make.

Select this button to see the structure of the network

Here is another example to try[ d o g .x. c h i e n ] | [ w o o f %- w o o f .x. o u a h %- o u a h] | [ c a t .x. c h a t ] | [ m i a o w .x. m i a u l e ]

DOWNWARD APPLICATION : Type upper-side strings (one per line) in this area to see the corresponding lower-side strings. dog UPWARD APPLICATION : Type lower-side strings (one per line) in this area to see the corresponding upper-side strings. miaow 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, Pasi Tapanainen, Todd Yampol. We hope that it will be useful as a teaching aid. We welcome comments and questions. Back to Finite State Technology homepage