Question: Question 3 a) Regular expressions are as powerful as a deterministic finite-state automaton. State whether the above statement is true or false? Give your reasons

Question 3 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 (2 marks) b) Can the language L a b 20 be recognized by a Pushdown Automaton (PDA)? Explain your answer in not more than two or three lines. (3 marks) c) 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. (3 marks) Question 3 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 (2 marks) b) Can the language L a b 20 be recognized by a Pushdown Automaton (PDA)? Explain your answer in not more than two or three lines. (3 marks) c) 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
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
