State Complexity Research and Approximation

  • Sheng Yu
  • Yuan Gao
Conference paper

DOI: 10.1007/978-3-642-22321-1_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6795)
Cite this paper as:
Yu S., Gao Y. (2011) State Complexity Research and Approximation. In: Mauri G., Leporati A. (eds) Developments in Language Theory. DLT 2011. Lecture Notes in Computer Science, vol 6795. Springer, Berlin, Heidelberg

Abstract

A number of basic questions concerning the state complexity research are discussed, which include why many basic problems weren’t studied earlier, whether there is a general algorithm for state complexity, and whether there is a new approach in this area of research. The new concept of state complexity approximation is also discussed. We show that this new concept can be used to obtain good results when the exact state complexities are difficult to find.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Sheng Yu
    • 1
  • Yuan Gao
    • 1
  1. 1.Department of Computer ScienceUniversity of Western OntarioLondonCanada

Personalised recommendations