State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages

Hae-Sung Eom, Yo-Sub Han, Kai Salomaa. State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages. In Helmut Jürgensen, Rogério Reis, editors, Descriptional Complexity of Formal Systems - 15th International Workshop, DCFS 2013, London, ON, Canada, July 22-25, 2013. Proceedings. Volume 8031 of Lecture Notes in Computer Science, pages 78-89, Springer, 2013. [doi]

Abstract

Abstract is missing.