State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet

Michal Kunc, Alexander Okhotin. State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet. In Markus Holzer, Martin Kutrib, Giovanni Pighizzini, editors, Descriptional Complexity of Formal Systems - 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings. Volume 6808 of Lecture Notes in Computer Science, pages 222-234, Springer, 2011. [doi]

Abstract

Abstract is missing.