Recursive Language
22,99 €
inkl. MwSt.

Versandfertig in 6-10 Tagen
payback
11 °P sammeln
  • Broschiertes Buch

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. A recursive language in mathematics, logic and computer science is a type of formal language which is also called decidable or Turing-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.

Andere Kunden interessierten sich auch für
Produktbeschreibung
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. A recursive language in mathematics, logic and computer science is a type of formal language which is also called decidable or Turing-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.