期刊名称：Electronic Proceedings in Theoretical Computer Science
电子版ISSN：2075-2180
出版年度：2009
卷号：3
页码：121-130
DOI：10.4204/EPTCS.3.11
出版社：Open Publishing Association
摘要：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.
