Which one of the following is the strongest correct statement about a finite language Lover a finite alphabet ??
A) L is undecidable
B) L is recursive
C) L is a CSL
D) L is a regular set
Correct Answer:
Verified
Q10: The set strings of 0's and 1's
Q11: The problem 3-SAT and 2-SAT are
A)Both in
Q12: Which of the following instances of the
Q13: Let FHAM be the problem of finding
Q14: Consider three problems P1, P2 and P3.
Q16: Which one of the following is not
Q17: Which of the following statements are TRUE?
(1)
Q18: Consider a graph G = (V, E)
Q19: Which of the following statement is false
Q20: Two persons X and Y have been
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents