3. Convert the following FA to a regular expression 2. b. S1 S 0 S2 S3...

 

Transcribed Image Text:

3. Convert the following FA to a regular expression 2. b. S1 S 0 S2 S3 ST 4. Prove the following languages are not regular a. {Onion | n>=2} b. 012n n=1; 3. Convert the following FA to a regular expression 2. b. S1 S 0 S2 S3 ST 4. Prove the following languages are not regular a. {Onion | n>=2} b. 012n n=1;