Efficient Construction of Semilinear Representations of Languages Accepted by Unary Nondeterministic Finite Automata
Zdeněk Sawa · Fundamenta Informaticae · 2013
In languages over a unary alphabet, i.e., an alphabet with only one letter, words can be identified with their lengths. It is well known that each regular language over a unary alphabet can be represented as the union of a finite number of arithmetic