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.

Obtaining Tight Upper Bounds for the State Complexities of DFA Operations

Sheng Yu, Qingyu Zhuang, Kai Salomaa. Obtaining Tight Upper Bounds for the State Complexities of DFA Operations. In Waldemar W. Koczkodaj, Peter E. Lauer, Anestis A. Toptsis, editors, Computing and Information - ICCI 92, Fourth International Conference on Computing and Information, Toronto, Ontario, Canada, May 28-30, 1992, Proceedings. pages 100-104, IEEE Computer Society, 1992.

Abstract

Abstract is missing.

runs on