{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:56:03Z","timestamp":1725490563754},"publisher-location":"Berlin, Heidelberg","reference-count":13,"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_21","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T13:49:49Z","timestamp":1188308989000},"page":"252-262","source":"Crossref","is-referenced-by-count":5,"title":["Unary Language Concatenation and Its State Complexity"],"prefix":"10.1007","author":[{"given":"Giovanni","family":"Pighizzini","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,20]]},"reference":[{"key":"21_CR1","unstructured":"C.C ampeanu, K. Culik II, K. Salomaa, and S. Yu. State complexity of basic operations on finite languages. Proceeding of the Fourth International Workshop on Implementing Automata WIA\u201999, 1999."},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(86)90142-8","volume":"47","author":"M. Chrobak","year":"1986","unstructured":"M. Chrobak. Finite automata and unary languages. Theoretical Computer Science, 47:149\u2013158, 1986.","journal-title":"Theoretical Computer Science"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1137\/0222009","volume":"22","author":"V. Geffert","year":"1993","unstructured":"V. Geffert. Tally version of the Savitch and Immerman-Szelepcs\u00e9nyi theorems for sublogarithmic space. SIAM J. Computing, 22:102\u2013113, 1993.","journal-title":"SIAM J. Computing"},{"key":"21_CR4","volume-title":"Introduction to automata theory, languages, and computation","author":"J. Hopcroft","year":"1979","unstructured":"J. Hopcroft and J. Ullman. Introduction to automata theory, languages, and computation. Addison-Wesley, Reading, MA, 1979."},{"key":"21_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/3-540-54458-5_73","volume-title":"Fundamentals of Computation Theory (FCT\u201991)","author":"J. Ka\u014beps","year":"1991","unstructured":"J. Ka\u014beps. Regularity of one-letter languages acceptable by 2-way finite probabilistic automata. In Fundamentals of Computation Theory (FCT\u201991), Lecture Notes in Computer Science 529, pages 287\u2013296, 1991."},{"key":"21_CR6","first-page":"337","volume":"2","author":"U. Liubicz","year":"1964","unstructured":"U. Liubicz. Bounds for the optimal determinization of nondeterministic autonomic automata. Sibirskii Matemat. Journal, 2:337\u2013355, 1964. (In Russian).","journal-title":"Sibirskii Matemat. Journal"},{"key":"21_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BFb0028556","volume-title":"15th Annual Symposium on Theoretical Aspects of Computer Science","author":"C. Mereghetti","year":"1998","unstructured":"C. Mereghetti and G. Pighizzini. Optimal simulations between unary automata. In 15th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 1373, pages 139\u2013149. Springer, 1998. To appear in SIAM J. Computing."},{"key":"21_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/3-540-48340-3_21","volume-title":"Mathematical Foundations of Computer Science (MFCS\u201999)","author":"C. Nicaud","year":"1999","unstructured":"C. Nicaud. Average state complexity of operations on unary automata. In Mathematical Foundations of Computer Science (MFCS\u201999), Lecture Notes in Computer Science 1672, pages 231\u2013240, 1999."},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0304-3975(96)00189-2","volume":"180","author":"C. Pomerance","year":"1997","unstructured":"C. Pomerance, J. Robson, and J. Shallit. Automaticity II: Descriptional complexity in the unary case. Theoretical Computer Science, 180:181\u2013201, 1997.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"21_CR10","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1006\/jcss.1996.0046","volume":"53","author":"J. Shallit","year":"1996","unstructured":"J. Shallit and Y. Breitbart. Automaticity I: Properties of a measure of descriptional complexity. Journal of Computer and System Sciences, 53(1):10\u201325, 1996.","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"J. Shallit. State complexity and Jacobsthal\u2019s function. Fifth International Conference on Implementation and Application of Automata, CIAA 2000. These proceedings.","DOI":"10.1007\/3-540-44674-5_23"},{"key":"21_CR12","unstructured":"S. Yu. State complexity for regular languages. In International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, Preprint n. 17, pages 77\u201388. Department of Computer Science, Otto-von-Guericke University of Magdeburg, 1999."},{"issue":"2","key":"21_CR13","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 complexities of some basic operations on regular languages. Theoretical Computer Science, 125(2):315\u2013328, 1994.","journal-title":"Theoretical Computer Science"}],"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_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T17:06:06Z","timestamp":1556816766000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44674-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424918","9783540446743"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44674-5_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}