Question: a) Regular expressions are as powerful as a deterministic finite-state automaton. State whether the above statement is true or false? Give your reasons in not
a) Regular expressions are as powerful as a deterministic finite-state automaton. State whether the above statement is true or false? Give your reasons in not more than one or two sentences. (2m)
b)Which is more powerful, an unrestricted grammar or a Pushdown Automaton (PDA)? State your rationale or reasons to support your answer in one or two lines. (2m)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
