L = ambn, m  n


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),   Language Identify: Example 9Language Identify: Examples 12




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 more details see the above links)


As per the given language number of ‘a’ is greater than or equal to the number of ’b’ in all strings belongs to this given language.


So, in that case, two circumstances can happen



1. ambn, m > n : In that case after all push and pop operations if input tape has empty but the stack has one or more alphabet ‘a’ then we can say the string is accepted otherwise rejected.


2. ambn, m = n : In that case after all push and pop operations if both input tape and stack will be empty then the string will be accepted otherwise rejected.






(This type of strings are accepted)


Corresponding DPDA: