Question

write NPDAs to accept the following language Enter it in JFLAP and and treace its correctness a { a^ n b^ n |n>=0,n=2m , and n mod 3 = 0 }

Answer 1

Answer:

Here, we need to maintain the order of a’s and b’s. That is, all the a’s are are coming first and then all the b’s are coming. Thus, we need a stack along with the state diagram. The count of a’s and b’s is maintained by the stack. We will take 2 stack alphabets