hw6 - )) ((q, ,i),(q, ) Accept by empty stack 69a) No, we...

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

View Full Document Right Arrow Icon
benjamin p. horstman eecs 343 hw 6 1b) For some CFG G = ( Q , , P , s ) We can construct DFA D = ( Q , , , s ,F ) by: P = { p --> aq for each (p,a) = q} U {q --> for each q F} 2) PDA M = ( Q , , , , s ,i , F ) Q = {q} = {a,b} ={i,a} s = q consists of: ((q,a,i),(q,a)) ((q,a,a),(q,aa)) ((q,b,a),(q,
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: )) ((q, ,i),(q, ) Accept by empty stack 69a) No, we can't have string end with b 69b) S --> AB --> aaaaBS --> aaaabA --> aaaaba 69c) No, cannot have two consecutive b 69d) S --> ABS --> abAS --> abaS --> abaAB --> abaaB --> abaabA --> abaaba...
View Full Document

This note was uploaded on 04/28/2010 for the course EECS 343 taught by Professor Jingli during the Spring '07 term at Case Western.

Ask a homework question - tutors are online