Grail man pages

Filters for finite languages


flappend append two finite languages
flexec test a word for membership in a finite language
flfilter intersect a finite language with a finite-state machine
fllq left quotient
flprepen prepend a finite language with a string
flprod product of two finite languages
flrevers reverse a finite language
flrq right quotient
fltofm convert a finite language to a finite-state machine
fltore convert a finite language to a regular expression
flunion union of two finite languages

Filters for finite-state machines


fmcat catenate two finite-state machines
fmcment complement a finite-state machine
fmcomp complete a finite-state machine
fmcross cross product of two finite-state machines
fmdeterm make a finite-state machine deterministic
fmenum enumerate the language of a finite state machine
fmexec test a word for membership in the language of a finite-state machine
fmmin minimize a machine by Hopcroft's algorithm
fmminrev minimize a machine by Brzozowski's algorithm
fmplus compute + of a finite-state machine
fmreach compute the reachable submachine of a finite-state machine
fmrenum canonical numbering of a deterministic finite-state machine
fmrevers reverse a finite-state machine
fmstar Kleene star of a finite-state machine
fmstats statistics about a finite-state machine
fmtofl convert a finite-state machine to a finite language (if the language of the machine is finite)
fmtore convert a finite-state machine to a regular expression
fmunion union of two finite-state machines
iscomp test for completeness of a finite-state machine
isdeterm test for determinism of a finite-state machine
isomorph test two finite-state machines for isomorphism
isuniv test for universality of a finite-state machine

Filters for regular expressions


recat catenate two regular expression
remin minimal bracketing of a regular expression
restar Kleene star of a regular expression
retofl convert regular expression to finite language (if the language of the expression is finite)
retofm convert regular expression to finite-state machine
reunion union of two regular expressions
isempty test regular expression for equivalence to empty string
isnull test regular expression for equivalence to empty set

File formats


grail main Grail man page
fl finite languages
fm finite-state machines
re regular expressions