Multiple choice

Which of the following is not true for recursive languages?

  1. Recursive languages are undecidable.

  2. Recursive languages are a recursive subset in the set of all possible words over the alphabet of the language.

  3. Recursive languages are closed under set difference operation.

  4. Recursive languages are closed under complementation.

  5. Recursive languages are closed under union.
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

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.

Keep practicing — related questions