Minimal Union-Free Decompositions of Regular Languages

Sergey Afonin, Denis Golomazov. Minimal Union-Free Decompositions of Regular Languages. In Adrian Horia Dediu, Armand-Mihai Ionescu, Carlos Martín-Vide, editors, Language and Automata Theory and Applications, Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings. Volume 5457 of Lecture Notes in Computer Science, pages 83-92, Springer, 2009. [doi]

Authors

Sergey Afonin

This author has not been identified. Look up 'Sergey Afonin' in Google

Denis Golomazov

This author has not been identified. Look up 'Denis Golomazov' in Google