State Complexity of Subtree-Free Regular Tree Languages

Hae-Sung Eom, Yo-Sub Han, Sang-Ki Ko. State Complexity of Subtree-Free Regular Tree 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 66-77, Springer, 2013. [doi]

Abstract

Abstract is missing.