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

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!