Kleene Star: Difference between revisions
Created page with "The unary regular operator commonly represented as '*', describing: * zero or more transitions (A*) through a finite automaton (A) * the smallest superset (V*) of a set of str..." |
No edit summary |
||
| Line 4: | Line 4: | ||
* the set of all strings (Σ*) of symbols in an alphabet Σ, such that λ ⊂ Σ* | * the set of all strings (Σ*) of symbols in an alphabet Σ, such that λ ⊂ Σ* | ||
** λ is the empty string | ** λ is the empty string | ||
==See Also== | |||
* [[Kleene Plus]] | |||
* [[Kleene Closure]] | |||
[[CATEGORY: Computer Science Eponyms]] | [[CATEGORY: Computer Science Eponyms]] | ||