Talk:Recognizable language

This redirect is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology 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.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles

Philosophy: Logic

This redirect is within the scope of WikiProject Philosophy, a collaborative effort to improve the coverage of content related to philosophy on Wikipedia. If you would like to support the project, please visit the project page, where you can get more details on how you can help, and where you can join the general discussion about philosophy content on Wikipedia.PhilosophyWikipedia:WikiProject PhilosophyTemplate:WikiProject PhilosophyPhilosophy articles

Associated task forces:
/
	Logic

Untitled[edit]

Must the FSM accept L (and perhaps more) as input or exactly L as input? - 129.100.75.90 17:13, 24 August 2007 (UTC)[reply]

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)[reply]

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)[reply]

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)[reply]