E97-1058 The work described here used a finite-state calculus implemented by the author in
P95-1003 expression compiler in the Xerox finite-state calculus . Acknowledgments This work is
P96-1015 Abstract This paper introduces to the finite-state calculus a family of directed replace
A97-1012 from regular expressions that use finite-state calculus op - erators , mainly the Replace
E97-1058 the formulae directly using the finite-state calculus . The second is to use , in intermediate
C00-2095 target automaton , like in regular finite-state calculus . Resources can be compiled by
C96-2105 Ronald Kaplan and Martin Kay on the finite-state calculus and the implementation of phonological
P04-3023 applications in a prototype weighted finite-state calculus tool . Introduction The addition
P04-3023 and algorithms used in classical finite-state calculus . Interesting consequences are
E97-1058 how the general machinery of a finite-state calculus can be usefully applied as a
C00-1054 Furdmrmore , software implementing the finite-state calculus is available for research purposes
J00-1006 . It must be stressed that the finite-state calculus library , as well as the rule
E97-1058 wildcard ' capabilities of the finite-state calculus . Figure 2 shows the sequence
E97-1058 testing the algorithm using the finite-state calculus in Prolog : the regular expressions
P97-1058 . 2 Finite-state calculus A ` finite-state calculus ' or ` finite automata toolkit
E97-1058 . 2 Finite-state calculus A ` finite-state calculus ' or ` finite automata toolkit
J09-3002 Furthermore , software implementing the finite-state calculus is available for research purposes
P95-1003 to Xerox implementations of the finite-state calculus , but equivalent formulations
E97-1058 same method can be used with the finite-state calculus approach : Define the relation
P04-3021 2Furthermore , software implementing the finite-state calculus is available for research purposes
hide detail