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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Yu, S., & Gao, Y. (2011). State complexity research and approximation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6795 LNCS, pp. 46–57). https://doi.org/10.1007/978-3-642-22321-1_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
