Multiple Choice
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
Correct Answer:
Verified
Q15: Two persons X and Y have been
Q16: Which one of the following is not
Q17: Choose the incorrect statement.<br>A)A Mealy machine generates
Q18: The problem 3-SAT and 2-SAT are<br>A)Both in
Q19: Context free grammar is used for-<br>A)Lexical analyzer<br>B)Document
Q20: 3-SAT and 2-SAT problems are<br>A)NP-complete and in
Q21: Choose the incorrect statement:<br>A)(a+b)aa(a+b)generates Regular language.<br>B)A language
Q22: Consider three problems P1, P2 and P3.
Q24: Which of the following statements are TRUE?<br>(1)
Q25: The set strings of 0's and 1's