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 Prefix-Free Regular Languages

Yo-Sub Han, Kai Salomaa, Derick Wood. State Complexity of Prefix-Free Regular Languages. In Hing Leung, Giovanni Pighizzini, editors, 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21 - 23, 2006. Proceedings. pages 165-176, New Mexico State University, Las Cruces, New Mexico, USA, 2006.

Abstract

Abstract is missing.

runs on