This document describes a language L consisting of strings with the form anbm where n is greater than m. To show L is a deterministic context-free language, a pushdown automaton can be constructed that uses its stack to keep track of the number of a's and b's seen, accepting the string if the stack is empty after seeing the entire string when the number of a's was greater than the number of b's.