hw10a - Copy (2)

hw10a - Copy (2) - gj q 3 gj q 4 gj a λ/A b λ/λ b A/λ b...

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

View Full Document Right Arrow Icon
MCS4653, Theory of Computation Homework Assignment 10, Due 11/17/03 Class Discussion Page 1 Construct a PDAs that accept each of the following languages. 1. (Sudkamp 9.3d) { w | w ∈ { a,b } * and w has the same number of a ’s and b ’s } . q 0 j q 1 j q 2 j q 3 j q 4 gj λ λ/E a A/A a E/E λ λ/A b B/B b E/E λ λ/B a B/λ b A/λ λ E/λ 2. (Sudkamp 9.3f) { a i b i | i 0 } ∪ a * b * . q 0 j q 1 gj q 2 gj q 3 gj b A/λ λ λ/λ b λ/λ a λ/A b A/λ λ A/λ b λ/λ 3. (Sudkamp 9.3h) { a i b j | i 6 = j } . q 0 j q 2 j q 1
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: gj q 3 gj q 4 gj a λ/A b λ/λ b A/λ b λ/λ λ A/λ a λ/A b A/λ b λ/λ λ A/λ 4. (Sudkamp 9.3i) { a i b j | ≤ i ≤ j ≤ 2 i } . q j q 1 j q 2 gj q 3 gj a λ/A λ λ/A b A/λ λ λ/λ a λ/A b A/λ 5. (Sudkamp 9.3k) the set of palindromes over { a,b } q j q 1 gj λ,a,b λ/λ a λ/A b λ/B a A/λ b B/λ...
View Full Document

Ask a homework question - tutors are online