Removing state q1, find a PDA with three states that accepts the same language as the PDA in Example 7.2. (Page 14 in the chapter 7's slide).

Extracted text: Removing state q1, find a PDA with three states that accepts the same language as the PDA in Example 7.2. (Page 14 in the chapter 7's slide).


Extracted text: • Example 7.2: Consider the NPDA Q = { 9o, 9,, q2, q3 }, E = { a, b }, r={ 0,1 }, z = 0, F = {q;} with initial state q, and transition function given by: 6(9,, a, 0) = { (q, 10), (q3, 2) } 6(90, 2, 0) = { (q3, 2) } %3| 6(q,, a, 1) = { (q1, 11) } 6(q1, b, 1) = { (q2, ^) } 6(q2, b, 1) = { (q2, ^) } 6(q2, ^, 0) = { (q3, 2) }