Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Recursively_enumerable_language> ?p ?o }
Showing triples 1 to 83 of
83
with 100 triples per page.
- Recursively_enumerable_language abstract "In mathematics, logic and computer science, a formal language is called recursively enumerable (also recognizable, partially decidable, semidecidable, Turing-acceptable or Turing-recognizable) if it is a recursively enumerable subset in the set of all possible words over the alphabet of the language, i.e., if there exists a Turing machine which will enumerate all valid strings of the language.Recursively enumerable languages are known as type-0 languages in the Chomsky hierarchy of formal languages. All regular, context-free, context-sensitive and recursive languages are recursively enumerable.The class of all recursively enumerable languages is called RE.".
- Recursively_enumerable_language wikiPageExternalLink 301lecture23.pdf.
- Recursively_enumerable_language wikiPageID "54789".
- Recursively_enumerable_language wikiPageLength "4471".
- Recursively_enumerable_language wikiPageOutDegree "46".
- Recursively_enumerable_language wikiPageRevisionID "678743023".
- Recursively_enumerable_language wikiPageWikiLink Alphabet_(formal_languages).
- Recursively_enumerable_language wikiPageWikiLink Arithmetical_hierarchy.
- Recursively_enumerable_language wikiPageWikiLink Category:Formal_languages.
- Recursively_enumerable_language wikiPageWikiLink Category:Mathematics_of_computing.
- Recursively_enumerable_language wikiPageWikiLink Category:Theory_of_computation.
- Recursively_enumerable_language wikiPageWikiLink Chomsky_hierarchy.
- Recursively_enumerable_language wikiPageWikiLink Closure_(mathematics).
- Recursively_enumerable_language wikiPageWikiLink Complement_(complexity).
- Recursively_enumerable_language wikiPageWikiLink Complement_(set_theory).
- Recursively_enumerable_language wikiPageWikiLink Computable_function.
- Recursively_enumerable_language wikiPageWikiLink Computer_science.
- Recursively_enumerable_language wikiPageWikiLink Concatenation.
- Recursively_enumerable_language wikiPageWikiLink Context-free_grammar.
- Recursively_enumerable_language wikiPageWikiLink Context-free_language.
- Recursively_enumerable_language wikiPageWikiLink Context-sensitive_language.
- Recursively_enumerable_language wikiPageWikiLink Entscheidungsproblem.
- Recursively_enumerable_language wikiPageWikiLink Formal_language.
- Recursively_enumerable_language wikiPageWikiLink Halting_problem.
- Recursively_enumerable_language wikiPageWikiLink Infinity.
- Recursively_enumerable_language wikiPageWikiLink Intersection_(set_theory).
- Recursively_enumerable_language wikiPageWikiLink Kleene_star.
- Recursively_enumerable_language wikiPageWikiLink Logic.
- Recursively_enumerable_language wikiPageWikiLink Mathematics.
- Recursively_enumerable_language wikiPageWikiLink Mortality_(computability_theory).
- Recursively_enumerable_language wikiPageWikiLink Post_correspondence_problem.
- Recursively_enumerable_language wikiPageWikiLink Posts_theorem.
- Recursively_enumerable_language wikiPageWikiLink RE_(complexity).
- Recursively_enumerable_language wikiPageWikiLink Recursive_language.
- Recursively_enumerable_language wikiPageWikiLink Recursively_enumerable_set.
- Recursively_enumerable_language wikiPageWikiLink Regular_language.
- Recursively_enumerable_language wikiPageWikiLink Set_(mathematics).
- Recursively_enumerable_language wikiPageWikiLink String_literal.
- Recursively_enumerable_language wikiPageWikiLink Subset.
- Recursively_enumerable_language wikiPageWikiLink Turing_machine.
- Recursively_enumerable_language wikiPageWikiLink Union_(set_theory).
- Recursively_enumerable_language wikiPageWikiLinkText "RE".
- Recursively_enumerable_language wikiPageWikiLinkText "Recursively enumerable language".
- Recursively_enumerable_language wikiPageWikiLinkText "Recursively enumerable language#Closure properties".
- Recursively_enumerable_language wikiPageWikiLinkText "Recursively enumerable".
- Recursively_enumerable_language wikiPageWikiLinkText "Type 0 (Recursively enumerable)".
- Recursively_enumerable_language wikiPageWikiLinkText "computably enumerable".
- Recursively_enumerable_language wikiPageWikiLinkText "enumerated by a computer program".
- Recursively_enumerable_language wikiPageWikiLinkText "recursively enumerable language".
- Recursively_enumerable_language wikiPageWikiLinkText "recursively enumerable".
- Recursively_enumerable_language wikiPageUsesTemplate Template:CZoo.
- Recursively_enumerable_language wikiPageUsesTemplate Template:Formal_languages_and_grammars.
- Recursively_enumerable_language wikiPageUsesTemplate Template:No_footnotes.
- Recursively_enumerable_language subject Category:Formal_languages.
- Recursively_enumerable_language subject Category:Mathematics_of_computing.
- Recursively_enumerable_language subject Category:Theory_of_computation.
- Recursively_enumerable_language type Area.
- Recursively_enumerable_language type Language.
- Recursively_enumerable_language type Area.
- Recursively_enumerable_language type Combinatoric.
- Recursively_enumerable_language type Language.
- Recursively_enumerable_language comment "In mathematics, logic and computer science, a formal language is called recursively enumerable (also recognizable, partially decidable, semidecidable, Turing-acceptable or Turing-recognizable) if it is a recursively enumerable subset in the set of all possible words over the alphabet of the language, i.e., if there exists a Turing machine which will enumerate all valid strings of the language.Recursively enumerable languages are known as type-0 languages in the Chomsky hierarchy of formal languages. ".
- Recursively_enumerable_language label "Recursively enumerable language".
- Recursively_enumerable_language sameAs Q1073063.
- Recursively_enumerable_language sameAs Rekurzivně_spočetný_jazyk.
- Recursively_enumerable_language sameAs Rekursiv_aufzählbare_Sprache.
- Recursively_enumerable_language sameAs Lenguaje_recursivamente_enumerable.
- Recursively_enumerable_language sameAs زبان_شمارشپذیر_بازگشتی.
- Recursively_enumerable_language sameAs Rekurzivno_prebrojiv_jezik.
- Recursively_enumerable_language sameAs Linguaggio_ricorsivamente_enumerabile.
- Recursively_enumerable_language sameAs 帰納的可算言語.
- Recursively_enumerable_language sameAs 재귀_열거_언어.
- Recursively_enumerable_language sameAs Język_rekurencyjnie_przeliczalny.
- Recursively_enumerable_language sameAs Linguagem_recursivamente_enumerável.
- Recursively_enumerable_language sameAs m.0f8z3.
- Recursively_enumerable_language sameAs Рекурсивно_перечислимый_язык.
- Recursively_enumerable_language sameAs Rekurzivno_prebrojiv_jezik.
- Recursively_enumerable_language sameAs Rekurzívne_vyčísliteľný_jazyk.
- Recursively_enumerable_language sameAs Рекурзивно_пребројив_језик.
- Recursively_enumerable_language sameAs Q1073063.
- Recursively_enumerable_language sameAs 递归可枚举语言.
- Recursively_enumerable_language wasDerivedFrom Recursively_enumerable_language?oldid=678743023.
- Recursively_enumerable_language isPrimaryTopicOf Recursively_enumerable_language.