Question: Call a unary language an arithmetic progression if it is the set { x^(m+ni) } : i >= 0 for some m and n demonstrate that if a unary language is regular , then it is the union of a finite set and a finite number of arithmetic progressions
Show the unary language is regular or not. Rationalize your answer by math, measurement or example, something convincing.