Henning Bordihn Markus Holzer Martin Kutrib Determination of finite automata accepting subregular languages. 3209-3222 2009 410 Theor. Comput. Sci. 35 http://dx.doi.org/10.1016/j.tcs.2009.05.019 db/journals/tcs/tcs410.html#BordihnHK09