{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:55:58Z","timestamp":1725490558204},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424918"},{"type":"electronic","value":"9783540446743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44674-5_23","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T09:49:49Z","timestamp":1188294589000},"page":"272-278","source":"Crossref","is-referenced-by-count":1,"title":["State Complexity and Jacobsthal\u2019s Function"],"prefix":"10.1007","author":[{"given":"Jeffrey","family":"Shallit","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,20]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1112\/S0025579300011645","volume":"43","author":"S.D. Adhikari","year":"1996","unstructured":"S.D. Adhikari and R. Balasubramanian. On a question regarding visibility of lattice points. Mathematika, 43:155\u2013158, 1996.","journal-title":"Mathematika"},{"key":"23_CR2","unstructured":"E. Bach and J. Shallit. Algorithmic Number Theory. MIT Press, 1996."},{"key":"23_CR3","unstructured":"J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979."},{"key":"23_CR4","first-page":"225","volume":"11","author":"H. Iwaniec","year":"1978","unstructured":"H. Iwaniec. On the problem of Jacobsthal. Dem. Math., 11:225\u2013231, 1978.","journal-title":"Dem. Math"},{"key":"23_CR5","first-page":"117","volume":"33","author":"E. Jacobsthal","year":"1960","unstructured":"E. Jacobsthal. \u00dcber Sequenzen ganzer Zahlen. von denen keine zu n teilerfremd ist. I-III. Norske Vid. Selsk. Forh. Trondheim, 33:117\u2013139, 1960.","journal-title":"Norske Vid. Selsk. Forh. Trondheim"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/BF01350607","volume":"170","author":"H.-J. Kanold","year":"1967","unstructured":"H.-J. Kanold. \u00dcber eine zahlentheoretische Funktion von Jacobsthal. Math. Annalen, 170:314\u2013326, 1967.","journal-title":"Math. Annalen"},{"key":"23_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/3-540-48340-3_21","volume-title":"Proc. 24nd Symposium, Mathematical Foundations of Computer Science 1999","author":"C. Nicaud","year":"1999","unstructured":"C. Nicaud. Average state complexity of operations on unary automata. In M. Kutylowski, L. Pacholski, and T. Wierzbicki, editors, Proc. 24nd Symposium, Mathematical Foundations of Computer Science 1999, volume 1672 of Lecture Notes in Computer Science, pages 231\u2013240. Springer-Verlag, 1999."},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"G. Pighizzini. Unary language concatenation and its state complexity. Proc. CIAA 2000.","DOI":"10.1007\/3-540-44674-5_21"},{"key":"23_CR9","doi-asserted-by":"crossref","first-page":"367","DOI":"10.4064\/aa-42-4-367-389","volume":"42","author":"G. Robin","year":"1983","unstructured":"G. Robin. Estimation de la fonction de Tchebychef \u00d8 sur le k-i\u00e9me nombre premier et grandes valeurs de la fonction \u03c9(n) nombre de diviseurs premiers de n. Acta Arith., 42:367\u2013389, 1983.","journal-title":"Acta Arith"},{"key":"23_CR10","unstructured":"S. Yu. State complexity of regular languages. In International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, Preproceedings, pages 77\u201388. Department of Computer Science, Otto-von-Guericke University of Magdeburg, July 1999."},{"issue":"3","key":"23_CR11","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1145\/126537.126543","volume":"22","author":"S. Yu","year":"1991","unstructured":"S. Yu and Q. Zhuang. On the state complexity of intersection of regular languages. SIGACT News, 22(3):52\u201354, Summer 1991.","journal-title":"SIGACT News"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(92)00011-F","volume":"125","author":"S. Yu","year":"1994","unstructured":"S. Yu, Q. Zhuang, and K. Salomaa. The state complexity of some basic operations on regular languages. Theoret. Comput. Sci., 125:315\u2013328, 1994.","journal-title":"Theoret. Comput. Sci"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44674-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T13:06:02Z","timestamp":1556802362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44674-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424918","9783540446743"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-44674-5_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}