Question: AUTOMATA QUESTION Given the language L = {a^n b^n | n >= 1} Someone told you that despite what you learned in class(CFL are not
AUTOMATA QUESTION
Given the language L = {a^n b^n | n >= 1} Someone told you that despite what you learned in class(CFL are not closed under complementation), the complement L^c of L is a CFL
i. Describe (handwave) a PDA for L^c, the complement of L
ii. Describe (handware) a TM for L^c, the complement of L
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
