Automaticity II: descriptional complexity in the unary case

Recurrence in Infinite Words

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science

Unary Language Concatenation and Its State Complexity

CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata

3-Party message complexity is better than 2-party ones for proving lower bounds on the size of minimal nondeterministic finite automata

Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures

On the number of distinct languages accepted by finite automata with n states

Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures

Regular expressions: new results and open problems

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems

Regular expressions: new results and open problems

Journal of Automata, Languages and Combinatorics