hw10a - Copy (2)

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

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

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
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

This note was uploaded on 09/26/2011 for the course TOC 1345 taught by Professor Joe during the Spring '11 term at HDM Stuttgart.

Ask a homework question - tutors are online