Talk:Star-free language

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

Low

This article has been rated as Low-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Mathematics

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles
???	This article has not yet received a rating on the project's priority scale.

I don't understand how the language described in this article can be star-free. It can include strings of arbitrary length, so how can its regular expression possibly NOT require a Kleene star? 87.112.197.217 (talk) 19:17, 2 October 2011 (UTC)[reply]

I agree with the above comment. The "For example" is unclear: is it an example of a language that is or is not star-free? If star-free, then why does it use a construct (complement) that is not in the definition given in the previous sentence? I recommend that the "For example" sentence be removed, or completely rewritten. Mdernst (talk) 19:27, 19 October 2011 (UTC)[reply]

"All Boolean operators" refers to union, intersection and complement. You can see this from following the wikilink. However, I have added this explicitly to the lede. Hermel (talk) 21:53, 20 October 2011 (UTC)[reply]

Location in Chomsky hierarchy[edit]

In order to establish the location of the class of star-free languages in the (extended) Chomsky hierarchy (shown in the template at page bottom), could somebody give a (sourced) example of a regular language that is not star-free? - Jochen Burghardt (talk) 11:05, 25 February 2015 (UTC)[reply]

I've added one. Tim Smith (talk) 12:24, 8 October 2015 (UTC)[reply]