Then for all the bs that it reads it will take a off

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: will take the form 0R00 or 1R01 that will take it back to R0. Then it repeats until the end of the string. Problem 3 A = {aibjck | i = j or j = k where i, j, k ≥ 0} A is a combination of the two languages A0 ={aibick | i, k ≥ 0} and A1 ={aibkck | i, k ≥ 0}. The first PDA will push all a’s that were read onto the stack. Then for all the b’s that it reads it will take a off of the stack. If there are no a’s on the stack and b’s need to be read, then this case fails. Otherwise if we read c and there are no a’s then this one succeeds and it accepts. The second PDA will read all of the. Then it will push all of the b’s onto the stack. Then for every c that it reads it will pop b off the stack. If we are done reading c...
View Full Document

This note was uploaded on 11/29/2010 for the course CSC 873569 taught by Professor Roberts during the Spring '10 term at ASU.

Ask a homework question - tutors are online