A word set is finite sequence of non-empty CharSets.
All CharSets are guaranteed to be non-empty and to have the same maximum.
All FA and regex implementations are based on either CharSets or CharRanges. This is necessary
because it's not practical to represent the large character sets used in every-day regexes using single characters.
Consequently, it is more efficient to work with CharSets for them, so operations that yield the words of an
FA or regex typically yield WordSets instead of Words.
This type serves as a way to document word sets. It should not be used interchangeably with CharSet[].
A word set is finite sequence of non-empty CharSets.
All CharSets are guaranteed to be non-empty and to have the same maximum.
All FA and regex implementations are based on either CharSets or CharRanges. This is necessary because it's not practical to represent the large character sets used in every-day regexes using single characters. Consequently, it is more efficient to work with CharSets for them, so operations that yield the words of an FA or regex typically yield WordSets instead of Words.
This type serves as a way to document word sets. It should not be used interchangeably with
CharSet[].