Languages given by Finite Automata over the Unary Alphabet

Wojciech Czerwiński, Maciej Dębski, Tomasz Gogasz +5

This paper studies the complexity of operations on finite automata and the complexity of their decision problems when the alphabet is unary. Let $n$ denote the maximum of the numbe…