Theory of Automata, Fall 2022

Assignment 5
Design PDA of the following languages.

1. L1= { an bm c m d n| n ,m ≥0 }
2. L2= { an bn c m d m| n ,m ≥ 0}
3. L3= { an bm a2 n|n , m≥ 0 }
4. L4 ={ ai b j|i≤ j }
5. L5= { ai b j|i=2 j }
6. All nonempty strings that start and end with the same symbol.
7. All strings with more a's than b's.
8. {w | w contains at least 3 a’s }
9. L6= { an bm c m d 2 n| n ,m ≥0 }