Hi, i need help with Compiler construction question.
Consider the following regular expression.
p (p + q)* q
(i) Find its equivalent non-deterministic automaton using Thompson Construction method.
(ii) Find deterministic finite automaton of the non-deterministic finite automaton obtained in above using Subset Construction method.