State complexity of operations on two-way finite automata over a unary alphabet

Michal Kunc, Alexander Okhotin. State complexity of operations on two-way finite automata over a unary alphabet. Theoretical Computer Science, 449:106-118, 2012. [doi]

Abstract

Abstract is missing.