Talk:Syntactic monoid
Jump to navigation
Jump to search
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||||||||||||||||||
| ||||||||||||||||||||||||||||||||||||||
 | This article may be too technical for most readers to understand. (September 2010) |
WikiProject class rating
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)
Recognizable language
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)
- 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)