RegEqnsFm
structure
signature REGEQNSFM
structure RegEqnsFm
: REGEQNSFM
This structure combines the structure RegEqns for regular recursion equations with the structure Fm for finite machines.
structure E : REGEQNS
structure M : FM
type ''a machine = ''a M.machine
datatype re = datatype E.re
val accept : ''a machine -> ''a list -> bool
val retofm : ''a re -> ''a machine
val retominfm : ''a re -> ''a machine
val fmtore : ''a machine -> ''a re
val fmToEqns : ''a machine -> ''a re E.eqns
structure E : REGEQNS
structure M : FM
type ''a machine = ''a M.machine
datatype re = datatype E.re
accept m l
retofm r
retominfm r
fmtore m
fmToEqns m
RegExp, Fm, RegEqnsFm, ppRegEqnsFm
A function translating a right- or left-linear recursion equation system to a finite automaton would allow to regard equations of the form x.i = x.j + ... as epsilon-transitions in automata.