The type of a regular language term.

The empty term, representing no events.

Use one v to make a term representing the single occurrence of v.

Use sat f to make a term representing any event that satisfies the predicate f.

Use cat2 a b to make a term representing a and b concatenated.

Use cats s to make a term representing the concatenation of all the terms of s in sequential order.

Use alt2 a b to make a term representing the occurrence of either a or b.

Use alts s to make a term representing the occurrence of any of the alternatives in s.

Use opt t to make a term representing either zero or one occurences of t.

Use star t to make a term representing the Kleene star of t, i.e. zero, one or more occurrences of t.

Use seq t to make a term representing a sequence of occurrences of t.

If ~a is used, then it specifies the minimum number of occurrences in the recognized sequence. If ~b is used then it specifies the maximum number of occurrences in the recognized sequence. Composition raises Invalid_argument if a < 0 or b < a.

The type of a final state.

Use fin t r to make t into a final state identified by r