Minimal Union-Free Decompositions of Regular Languages.

Sergey A. Afonin, Denis Golomazov

Browse the full LATA paper archive.