Theory of Automata - Assignments

Q. 1. Draw a Finite Automaton (FA) that accepts the following strings:

         Λ, a, aabc, acba and accb                                                                    Marks [7]

Ans

 

Q. 2. Construct a finite automaton for the given Regular Expression (RE):

          (a + b)^*(ab + ba)⁺a⁺                                                                              Marks [8]

Ans

 

Q. 3. Draw a Transition Graph (TG) for the language expressed by the following regular expression:

     ^ + 0(01 + 10)*1 + 1(10 + 01)*0                                                         Marks [5]

    Ans