{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T18:54:36Z","timestamp":1794336876238,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540642305","type":"print"},{"value":"9783540697053","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0028556","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T02:33:39Z","timestamp":1132626819000},"page":"139-149","source":"Crossref","is-referenced-by-count":4,"title":["Optimal simulations between unary automata"],"prefix":"10.1007","author":[{"given":"Carlo","family":"Mereghetti","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giovanni","family":"Pighizzini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"14_CR1","unstructured":"C. Berge. Graphs and Hypergraphs. North-Holland, 1985."},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF01371727","volume":"26","author":"J.-C. Birget","year":"1993","unstructured":"J.-C. Birget. State-complexity of finite-state devices, state compressibility and incompressibility. Mathematical Systems Theory, 26:237\u2013269, 1993.","journal-title":"Mathematical Systems Theory"},{"key":"14_CR3","unstructured":"P. Berman and A. Lingas. On the complexity of regular languages in terms of finite automata. Technical Report 304, Polish Academy of Sciences, 1977."},{"key":"14_CR4","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":"14_CR5","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A. Chandra","year":"1981","unstructured":"A. Chandra, D. Kozen, and L. Stockmeyer. Alternation. Journal of the ACM, 28:114\u2013133, 1981.","journal-title":"Journal of the ACM"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1080\/00207169008803893","volume":"35","author":"A. Fellah","year":"1990","unstructured":"A. Fellah, H. Rirgensen, and S. Yu. Constructions for alternating finite automata. International J. Computer Math., 35:117\u2013132, 1990.","journal-title":"International J. Computer Math."},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1137\/0220031","volume":"20","author":"V. Geffert","year":"1991","unstructured":"V. Geffert. Nondeterministic computations in sublogarithmic space and space constructibility. SIAM J. Computing, 20:484\u2013498, 1991.","journal-title":"SIAM J. Computing"},{"key":"14_CR8","unstructured":"V. Geffert, 1997. Private communication."},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0022-0000(79)90025-4","volume":"19","author":"E. Gurari","year":"1979","unstructured":"E. Gurari and O. Ibarra. Simple counter machines and number-theoretic problems. Journal of Computer and System Sciences, 19:145\u2013162, 1979.","journal-title":"Journal of Computer and System Sciences"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1145\/322326.322340","volume":"29","author":"E. Gurari","year":"1982","unstructured":"E. Gurari and O. Ibarra. Two-way counter machines and Diophantine equations. Journal of the ACM, 29:863\u2013873, 1982.","journal-title":"Journal of the ACM"},{"key":"14_CR11","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":"14_CR12","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M.O. Rabin","year":"1959","unstructured":"M.O. Rabin and D. Scott. Finite automata and their decision problems. IBM J. Res. Develop, 3:114\u2013125, 1959.","journal-title":"IBM J. Res. Develop"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"W. Sakoda and M. Sipser. Nondeterminism and the size of two-way finite automata. In Proc. 10th ACM Symposium on Theory of Computing, pages 275\u2013286, 1978.","DOI":"10.1145\/800133.804357"}],"container-title":["Lecture Notes in Computer Science","STACS 98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028556","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T20:09:20Z","timestamp":1552939760000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028556"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540642305","9783540697053"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0028556","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/bfb0028542","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}