State Complexity Approximation

Yuan Gao
Sheng Yu

In this paper, we introduce the new concept of state complexity approximation, which is a further development of state complexity estimation. We show that this new concept is useful in both of the following two cases: the exact state complexities are not known and the state complexities have been obtained but are in incomprehensible form.

In Jürgen Dassow, Giovanni Pighizzini and Bianca Truthe: Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems (DCFS 2009), Magdeburg, Germany, July 6-9, 2009, Electronic Proceedings in Theoretical Computer Science 3, pp. 121–130.
Published: 30th July 2009.

ArXived at: http://dx.doi.org/10.4204/EPTCS.3.11 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org