who first introduced and widely used it to characterize automata for regular expressions.

Of an alphabet

Given an alphabet ,define
: (the set consists only of the empty string),
:and define recursively the set
: for each where denotes the string obtained by appending the single character to the end of . Here, ' can be understood to be the set of all strings of length exactly , with characters from .

The definition

1.Previous
3.Next