{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:01Z","timestamp":1725490201057},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424963"},{"type":"electronic","value":"9783540446835"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44683-4_35","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T01:32:38Z","timestamp":1188351158000},"page":"398-407","source":"Crossref","is-referenced-by-count":0,"title":["Converting Two\u2014Way Nondeterministic Unary Automata into Simpler Automata"],"prefix":"10.1007","author":[{"given":"Viliam","family":"Geffert","sequence":"first","affiliation":[]},{"given":"Carlo","family":"Mereghetti","sequence":"additional","affiliation":[]},{"given":"Giovanni","family":"Pighizzini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,5]]},"reference":[{"key":"35_CR1","unstructured":"Berman P., Lingas A.: On the complexity of regular languages in terms of finite automata. Tech. Report 304, Polish Academy of Sciences, 1977."},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(86)90142-8","volume":"47","author":"M. Chrobak","year":"1986","unstructured":"Chrobak M.: Finite automata and unary languages. Theoretical Computer Science, 47 (1986) 149\u201358.","journal-title":"Theoretical Computer Science"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1137\/0220031","volume":"20","author":"V. Geffert","year":"1991","unstructured":"Geffert V.: Nondeterministic computations in sublogarithmic space and space constructibility. SIAM J. Computing, 20 (1991) 484\u201398.","journal-title":"SIAM J. Computing"},{"key":"35_CR4","volume-title":"Introduction to automata theory, languages, and computation","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft J., Ullman J.: Introduction to automata theory, languages, and computation. Addison-Wesley, Reading, MA, 1979."},{"key":"35_CR5","first-page":"287","volume":"5","author":"C. Mereghetti","year":"2000","unstructured":"Mereghetti C., Pighizzini G.: Two-way automata simulations and unary languages. J. Aut., Lang. Comb., 5 (2000) 287\u2013300.","journal-title":"J. Aut., Lang. Comb."},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"1976","DOI":"10.1137\/S009753979935431X","volume":"30","author":"C. Mereghetti","year":"2001","unstructured":"Mereghetti C., Pighizzini G.: Optimal simulations between unary automata. SIAM J. Computing, 30 (2001) 1976\u201392.","journal-title":"SIAM J. Computing"},{"key":"35_CR7","unstructured":"Piterman N., VardiM. Y.: From bidirectionality to alternation. This Volume."},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Sakoda W., Sipser M.: Nondeterminism and the size of two-way finite automata. In Proc. 10th ACM Symp. Theory of Computing, 1978, pp. 275\u201386.","DOI":"10.1145\/800133.804357"},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-0000(80)90034-3","volume":"21","author":"M. Sipser","year":"1980","unstructured":"Sipser M.: Lower bounds on the size of sweeping automata. J. Computer and System Science, 21 (1980) 195\u2013202.","journal-title":"J. Computer and System Science"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44683-4_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T06:50:49Z","timestamp":1550904649000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44683-4_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424963","9783540446835"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-44683-4_35","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}