TCS Assign 3
TCS Assign 3
BLOOMS
Q. No. Questions CO
Level
For each of the following regular expression, draw a finite
automata recognizing the corresponding language
1. (1+10+11))*0
1 CO2 6
2. 1(01+10)*+0(11+10)*
3. (010+00)*(10)
4. 1(1+10)*+10(0+01)*
Define Pumping lemma .State and explain pumping lemma for
2 CO2 1
regular languages.