On the state complexity of intersection of regular languages
ACM SIGACT News
The state complexities of some basic operations on regular languages
Theoretical Computer Science
Algorithmic number theory
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Average State Complexity of Operations on Unary Automata
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Unary Language Concatenation and Its State Complexity
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Unary Language Concatenation and Its State Complexity
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
| Hi-index | 0.00 |
We find bounds for the state complexity of the intersection of regular languages over an alphabet of one letter. There is an interesting connection to Jacobsthal's function from number theory.