L And L Are Recursive Enumerable Then L Is #267
L and ~L are recursive enumerable then L is
This multiple choice question (MCQ) is related to the book/course
gs gs101 Automata Theory.
It can also be found in
gs gs101 Regular Expressions and Languages - Expression in Regular Language - Quiz No.2.
L and ~L are recursive enumerable then L is
Regular
Context free
Context sensitive
Recursive
Similar question(s) are as followings:
Online Quizzes of gs101 Automata Theory
Other Classes Of Problems - Randomized Algorithm - Quiz No.1
gs gs101 Automata Theory
Online Quizzes
Push Down Automata - DPDA and Ambiguous Grammars - Quiz No.1
gs gs101 Automata Theory
Online Quizzes
