Let S and T be language over ={a,b} represented by the regular expressions (a+b*) * and (a+b) *, respectively. Which of the following is true?
A) ScT (S is a subset of T)
B) TcS (T is a subset of S)
C) S=T
D) SnT=Ø
Correct Answer:
Verified
Q1: Which one of the following languages over
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
Q6: Let L denotes the language generated by
Q7: Consider the following two statements:
S1: { 0^2n
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)
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