Q4Theory of Computation
Question
10 marks
Explain the conversion of Regular Expression to Finite Automata using Thompson's construction.
Answer
Construction rules for FA from RE.
Rules: (1) Symbol 'a': start state to end state on 'a'. (2) Union : Parallel paths. (3) Concatenation : Serial paths with . (4) Star : Loop back with .