Hellis Tamm Esko Ukkonen Bideterministic automata and minimal representations of regular languages. 135-149 2004 328 Theor. Comput. Sci. 1-2 http://dx.doi.org/10.1016/j.tcs.2004.07.010 db/journals/tcs/tcs328.html#TammU04