Question: Exercise 2: 1. What is the language recognized by the following automata: a a Start 1 b 2. Prove that the languages corresponding to these

Exercise 2: 1. What is the language recognized by the following automata: a a Start 1 b 2. Prove that the languages corresponding to these regular expressions are Regular languages: = a) - (ba U b)* U (bb U a)* b) L2 = (ab U ba)*(aa U bb)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
