FSTTCS
2010
Springer
13 years 10 months ago
2010
Springer
In this paper we study the problem of minimising deterministic automata over finite and infinite words. Deterministic finite automata are the simplest devices to recognise regular...