Search the Kids Internet
Encyclopedia > Wpc decidable language
Article Content
Wikipedia:Wpc/decidable language
Redirected from Wpc/decidable language
|
Also known as: Recursive language
Definition: A formal language for which the following problem is decidable: "Given string X, does X belong in the language?"
- enumerable language (don't require that the algorithm stop on strings that don't belong in the language)
- co-enumerable language[?] (complement of an enumerable language)
- context-free language (accepted by a pushdown automaton)
Involved in: Nothing yet
Relevant Wikipedia Articles: the concept- decidable language
related field(s)- theory of computation
potential real-world examples-
/Discussion
- See also : Wpc
All Wikipedia text is available under the terms of the GNU Free Documentation License
|
Search Encyclopedia
|
Featured Article
|