Consider a language,
Design the corresponding Push Down Automata (PDA).
You should know:
Before seeing the solution please follow the previous chapter to clear the concept (How to identify language), Identification of language Example 2.
This given language is a Deterministic Context Free Language (DCFL) because it has one infinite comparison and push and pop are cleared in that case. (For details see the Identification of language Example 2).
The given language is a set of all strings generated by ‘a’ and ‘b’ where number of a = number of b.
Let take an example, ω = a a b b b b a b a a. Here number of a and b is same.