Computer Science – Formal Languages and Automata Theory
Scientific paper
2009-07-29
EPTCS 3, 2009, pp. 121-130
Computer Science
Formal Languages and Automata Theory
Scientific paper
10.4204/EPTCS.3.11
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.
Gao Yuan
Yu Sheng
No associations
LandOfFree
State Complexity Approximation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with State Complexity Approximation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and State Complexity Approximation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-521655