State Complexity of Combined Operations for Prefix-Free Regular Languages

Yo-Sub Han, Kai Salomaa, Sheng Yu. State Complexity of Combined Operations for Prefix-Free 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 398-409, Springer, 2009. [doi]

Abstract

Abstract is missing.