On the State Complexity of Closures and Interiors of Regular Languages with Subwords

Prateek Karandikar, Philippe Schnoebelen. On the State Complexity of Closures and Interiors of Regular Languages with Subwords. In Helmut Jürgensen, Juhani Karhumäki, Alexander Okhotin, editors, Descriptional Complexity of Formal Systems - 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014. Proceedings. Volume 8614 of Lecture Notes in Computer Science, pages 234-245, Springer, 2014. [doi]

Authors

Prateek Karandikar

This author has not been identified. Look up 'Prateek Karandikar' in Google

Philippe Schnoebelen

This author has not been identified. It may be one of the following persons: Look up 'Philippe Schnoebelen' in Google