Solved

Let S and T Be Language Over ={A,b} Represented by the Regular

Question 38

Multiple Choice

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=Ø

Related Questions

Q33: Pumping lemma is generally used for proving

Q34: Match all items in Group 1 with

Q35: Consider the following statements I. Recursive languages are

Q36: All NonNull words of the CFL can

Q37: Which of the following denotes Chomskianhiearchy? A)REG ?

Q39: If PCP is decidable then MPCP is A)Decidable B)Undecidable C)Can't

Q40: The PDA is called non-deterministic PDA when

Q41: FSM can recognize A)Any grammar B)Only CG C)Both (a) and

Q42: Consider the following Finite State Automaton The

Q43: PCP is: A)Decidable B)Undecidable C)Sometimes Decidable D)None of the