State Complexity Approximation
Formal Languages and Automata Theory
2009-07-30 v1
Abstract
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.
Cite
@article{arxiv.0907.5124,
title = {State Complexity Approximation},
author = {Yuan Gao and Sheng Yu},
journal= {arXiv preprint arXiv:0907.5124},
year = {2009}
}