abstract:In mathematics, logic and computer science, a formal language is called recursively enumerable (also recognizable, partially decidable, semidecidable or Turing-acceptable) if it is a recursively enumerable subset in the set of all possible words over the alphabet of the language, i.e.
The theorem that the languagesetdistinguisheddeterministicfiniteautomatonisarecursivelyenumerable set was proved, and then, therecursiveness ofregularlanguage was analyzed.