And via Parikh's theorem, with a one-symbol alphabet, regular and context-free languages are the same.