Kleene star
Builds on Formal languageString
Definition
Let be an alphabet and let be a formal language. Define , where is the empty string, and for . The Kleene star of is So exactly when for some and .
Remarks
Example: for , . The string is in , with , so it is in . Non-example: , since every member of has even length. Edge cases: , since and for . The Kleene plus is , and . For an alphabet , viewed as the language of strings of length , is the set of all strings over . is the smallest language that contains and and is closed under concatenation.
Reading path
To understand this page from the ground up, read these 25 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Element definition
- Monoid concept
- Proposition concept
- Set definition
- Implication definition
- Predicate definition
- Ordered pair definition
- Existential quantifier definition
- Universal quantifier definition
- Cartesian product definition
- Subset definition
- Uniqueness quantifier definition
- Binary relation definition
- Function definition
- Codomain definition
- Injective function definition
- Free monoid definition
- Surjective function definition
- Bijective function definition
- Equinumerous sets definition
- Finite set definition
- Alphabet definition
- String definition
- Formal language definition
- Kleene star definition
Further reading
About this page
| Tag | RVFHTPYYKR |
|---|---|
| URI | m2://RVFHTPYYKR |
| Kind | definition |
| Writing | W0 stub |
| MSC | 68Q45, 68R15 |
| Defines | Kleene star |
| Uses | Formal language, String |
| Changed | 3 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.