The language consisting of strings with equal numbers of 'a's and 'b's, which we showed was not a regular language, can be decided by a push-down automaton.
Jezik koji se sastoji od jednakog broja slova 'a' i 'b', za kojeg je pokazano da je neregularan, može odlučiti potisni automat.