This language L contains strings of 0s and 1s where the number of 1s must be greater than the number of 0s in the string. L is not a regular language because there is no finite state automaton that can recognize this pattern for strings of all lengths.