Abstract
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.
Cite
CITATION STYLE
APA
Shallit, J. (2001). State complexity and jacobsthal’s function. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2088, pp. 272–278). Springer Verlag. https://doi.org/10.1007/3-540-44674-5_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free