Computer science Automata and formal languages Concept
Star-free language
Summary
A star-free language is a regular language that can be built from finite languages by union, complement and concatenation, without the Kleene star. Complement makes this class larger than it first looks: some languages usually written with a star, such as , are star-free. By Schützenberger's theorem, a regular language is star-free exactly when its syntactic monoid is aperiodic. Star-free languages are also exactly the languages definable in first-order logic over words, a result of McNaughton and Papert.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | K83HS1C5WG |
|---|---|
| URI | m2://K83HS1C5WG |
| Kind | concept |
| Writing | W0 stub |
| MSC | 68Q45, 68Q70 |
| Specializes | Regular language |
| Same as | |
| 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.