Consider the following two statements:
S1: { 0^2n |n >= l} is a regu1ar language
S2: { 0^m 0^n 0^(m+n) l m >= 1 and n >= 2} is a regu1ar language
Which of the following statements is correct?
A) Only S1 is correct
B) Only S2 is correct
C) Both S1 and S2 are correct
D) None of S1 and S2 is correct
Correct Answer:
Verified
Q2: Which one of the following is FALSE?
A)There
Q3: Match all items in Group 1 with
Q4: Which of the following pairs have DIFFERENT
Q5: Let S and T be language over
Q6: Let L denotes the language generated by
Q8: Which of the following statements in true?
A)If
Q9: Given an arbitrary non-deterministic finite automaton (NFA)
Q10: Which of the following is true for
Q11: Which of the following are decidable ?
1)
Q12: If L and L' are recursively enumerable,
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