flunion
Name
flunion -- compute the union of two finite languages
Synopsis
flunion fl1 fl2
flunion fl2 <fl1
Description
flunion
computes the union of fl1 and fl2. This is defined as the language
containing the union of the words in fl1 and fl2.
fl1 and fl2 must conform to the Grail format
for finite languages.
Examples
% cat fl1
abc
def
% cat fl2
ghia
abc
zzab
% flunion fl1 fl2
abc
def
ghia
zzab
Authors
Roger Robson, Darrell Raymond and Derick Wood, the Grail project
See also
fl(5)