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 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
This article is within the scope of WikiProject Linguistics, a collaborative effort to improve the coverage of linguistics 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.LinguisticsWikipedia:WikiProject LinguisticsTemplate:WikiProject LinguisticsLinguistics articles
This article was automatically assessed because at least one WikiProject had rated the article as start, and the rating on other projects was brought up to start class. BetacommandBot 04:28, 10 November 2007 (UTC)[reply]
The link at the beggining of the article "recognizable language" doesn't make sens. It liinks to "recursive enumerable language" and not to recognizability by finite monoïd. I think one has to create a new page to explain this definition, or may be to add it to the monoïd page. — Preceding unsigned comment added by Arthur MILCHIOR (talk • contribs) 20:48, 22 October 2012 (UTC)[reply]
No, it is right. The case of a finite monoid is different, there you are looking at a regular language. Deltahedron (talk) 21:49, 22 October 2012 (UTC)[reply]
