 | This redirect does not require a rating on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
Untitled
editMust the FSM accept L (and perhaps more) as input or exactly L as input? - 129.100.75.90 17:13, 24 August 2007 (UTC)
- Since the set of all strings is recognizable, the first would encompass all possible languages. It would be good to have an actual reference though. Zarboublian (talk) 21:28, 25 April 2010 (UTC)
This article is completely wrong; the definition given here is actually the definition of a Regular Language. http://kilby.stanford.edu/~rvg/154/handouts/decidability.html gives the actual definition of a recognizable language. Recognizable languages are also knwon as recursively enumerable languages; I'm redirecting this article there. AurakDraconian (talk) 23:39, 9 April 2011 (UTC)
- Sorry but this is a misunderstanding! The fact that both language families are sometimes abbreviated by REC does not mean they are the same. Recognizable refers to an algebraic definition of the regular languages (using monoids or equivalence of strings). I undid the redirect. Jochgem (talk) 10:48, 25 September 2011 (UTC)