Which of the following statements is/are FALSE?

1. For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine. 2. Turing recognizable languages are closed under union and complementation. 3. Turing decidable languages are closed under intersection and complementation. 4. Turing recognizable languages are closed under union and intersection.

**(A)** 1 and 4 only**(B)** 1 and 3 only**(C)** 2 only**(D)** 3 only**Answer:** **(C)****Explanation:** A recognizer of a language is a machine that recognizes that language.

A decider of a language is a machine that decides that language.

Both types of machine halt in the Accept state on strings that are in the language

A Decider also halts if the string is not in the language

A Recogizer MAY or MAY NOT halt on strings that are not in the language

On all input:

A Decider MUST halt (in Accept or Reject state)

A Recogizer MAY or MAY NOT halt on some strings (Q: Which ones?)

A language is Turing-decidable (or decidable) if some Turing machine decides it. Aka Recursive Language.

A language is Turing-recognizable if some Turing machine recognizes it. Aka Recursively Enumerable Language.

Source: http://www.radford.edu/~nokie/classes/420/Chap3-Langs.html

Recursive (Turing Decidable) languages are closed under following

Kleene star, concatenation, union, intersection, complement and set difference.

Recursively enumerable language are closed under Kleene star, concatenation, union, intersection. They are NOT closed under complement or set difference.

Quiz of this Question

Attention reader! Don’t stop learning now. Learn all **GATE CS concepts with Free Live Classes** on our youtube channel.