Question 10243 – Theory-of-Computation
February 13, 2024Question 10564 – Theory-of-Computation
February 13, 2024Question 10563 – Theory-of-Computation
Choose the correct alternatives (More than one may be correct).
Recursive languages are:
Correct Answer: E
Question 31 Explanation:
A) True, since there are languages which are not CFL still recursive.
B) False.
C) False, because Type-0 language are actually recursively enumerable languages and not recursive languages.
D) True.
B) False.
C) False, because Type-0 language are actually recursively enumerable languages and not recursive languages.
D) True.
A proper superset of context free languages.
Always recognizable by pushdown automata.
Also called type ∅ languages.
Recognizable by Turing machines.
Both (A) and (D)
Subscribe
Login
0 Comments