Introduction to algorithms
Test Selection Based on Finite State Models
IEEE Transactions on Software Engineering
The state complexities of some basic operations on regular languages
Theoretical Computer Science
Cornerstones of undecidability
Cornerstones of undecidability
Handbook of formal languages, vol. 1
Synchronization expressions with extended join operation
Theoretical Computer Science - Special issue In Memoriam of Ronald V. Book
The Unified Modeling Language reference manual
The Unified Modeling Language reference manual
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Theory of Automata
Compressed Storage of Sparse Finite-State Transducers
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Worst-case analysis of memory allocation algorithms
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
State complexity of combined operations
Theoretical Computer Science
Enumeration and generation with a string automata representation
Theoretical Computer Science
The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal
Fundamenta Informaticae
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Estimation of state complexity of combined operations
Theoretical Computer Science
Unary language operations and their nondeterministic state complexity
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Undecidability of the state complexity of composed regular operations
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
State complexity of combined operations with two basic operations
Theoretical Computer Science
Sheng Yu (1950-2012) In Memoriam
Fundamenta Informaticae
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
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.