External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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]

Authors

Hae-Sung Eom

This author has not been identified. Look up 'Hae-Sung Eom' in Google

Yo-Sub Han

This author has not been identified. Look up 'Yo-Sub Han' in Google

Sang-Ki Ko

This author has not been identified. Look up 'Sang-Ki Ko' in Google
runs on