Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Recursive_language> ?p ?o. }
Showing items 1 to 37 of
37
with 100 items per page.
- Recursive_language abstract "In mathematics, logic and computer science, a formal language (a set of finite sequences of symbols taken from a fixed alphabet) is called recursive if it is a recursive subset of the set of all possible finite sequences over the alphabet of the language. Equivalently, a formal language is recursive if there exists a total Turing machine (a Turing machine that halts for every given input) that, when given a finite sequence of symbols from the alphabet of the language as input (any string containing only characters in the language's alphabet) accepts only those that are part of the language and rejects all other strings. Recursive languages are also called decidable.The concept of decidability may be extended to other models of computation. For example one may speak of languages decidable on a non-deterministic Turing machine. Therefore, whenever an ambiguity is possible, the synonym for "recursive language" used is Turing-decidable language, rather than simply decidable.The class of all recursive languages is often called R, although this name is also used for the class RP.This type of language was not defined in the Chomsky hierarchy of (Chomsky 1959). All recursive languages are also recursively enumerable. All regular, context-free and context-sensitive languages are recursive.".
- Recursive_language wikiPageID "23290990".
- Recursive_language wikiPageRevisionID "580012370".
- Recursive_language hasPhotoCollection Recursive_language.
- Recursive_language subject Category:Computability_theory.
- Recursive_language subject Category:Formal_languages.
- Recursive_language subject Category:Recursion.
- Recursive_language subject Category:Theory_of_computation.
- Recursive_language type Abstraction100002137.
- Recursive_language type Communication100033020.
- Recursive_language type FormalLanguages.
- Recursive_language type Language106282651.
- Recursive_language comment "In mathematics, logic and computer science, a formal language (a set of finite sequences of symbols taken from a fixed alphabet) is called recursive if it is a recursive subset of the set of all possible finite sequences over the alphabet of the language.".
- Recursive_language label "Język rekurencyjny".
- Recursive_language label "Langage récursif".
- Recursive_language label "Lenguaje recursivo".
- Recursive_language label "Linguagem recursiva".
- Recursive_language label "Linguaggio ricorsivo".
- Recursive_language label "Recursive language".
- Recursive_language label "Rekursive Sprache".
- Recursive_language label "Рекурсивный язык".
- Recursive_language label "帰納言語".
- Recursive_language label "递归语言".
- Recursive_language sameAs Rekurzivní_jazyk.
- Recursive_language sameAs Rekursive_Sprache.
- Recursive_language sameAs Lenguaje_recursivo.
- Recursive_language sameAs Langage_récursif.
- Recursive_language sameAs Linguaggio_ricorsivo.
- Recursive_language sameAs 帰納言語.
- Recursive_language sameAs Język_rekurencyjny.
- Recursive_language sameAs Linguagem_recursiva.
- Recursive_language sameAs m.0f2zv.
- Recursive_language sameAs Q1455907.
- Recursive_language sameAs Q1455907.
- Recursive_language sameAs Recursive_language.
- Recursive_language wasDerivedFrom Recursive_language?oldid=580012370.
- Recursive_language isPrimaryTopicOf Recursive_language.