Example:

Construct a Pushdown Automaton (PDA) for the language L (M) - fa, bl * where, if there are any b's must precede all a's and the number of a's must be greater than or equal to the number of b's less one. (6m) i. Trace the computations for the strings aab, abb, aba in the PDA obtained in (). (5m) Construct a Pushdown Automaton (PDA) for the language L (M) - fa, bl * where, if there are any b's must precede all a's and the number of a's must be greater than or equal to the number of b's less one. (6m) i. Trace the computations for the strings aab, abb, aba in the PDA obtained in (). (5m)