If L and L are recursively enumerable, then L is:

Question

Let a Non-deterministic Finite Automaton (NFA) have 6 states over a finite alphabet. Which of the following cannot be the number of states in a minimal Deterministic Finite Automaton (DFA) that is equivalent to this NFA?

Answer 1

A language L is recursive if, and only if, both L and its complement L are recursively enumerable (RE). The simultaneous enumerability of a language and its complement allows for membership to be decided, thereby classifying the language as recursive.

LIST I	LIST II
(A) Unification	(I) Variable can be done with a constant, another variable, or a function.
(B) Deep backtracking	(II) The entire conjunctive goal is executed.
(C) Forward movement	(III) Choose subgoal with possible unifier.
(D) Shallow backtracking	(IV) Previous subgoal to find alternative solutions.

If L and L are recursively enumerable, then L is:

Show Hint

The Correct Option is D

Solution and Explanation

Top Questions on Theory of Computations

Questions Asked in CUET (PG) exam