{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:35:44Z","timestamp":1725557744621},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135224"},{"type":"electronic","value":"9783642135231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13523-1_21","type":"book-chapter","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T04:34:26Z","timestamp":1277267666000},"page":"188-188","source":"Crossref","is-referenced-by-count":2,"title":["Quantum Finite State Automata over Infinite Words"],"prefix":"10.1007","author":[{"given":"Ilze","family":"Dzelme-B\u0113rzi\u0146a","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J.R. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. Z. Math. Logik Grundlag. Math.\u00a06, 66\u201392 (1960)","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","volume":"9","author":"R. McNaughton","year":"1966","unstructured":"McNaughton, R.: Testing and generating infinite sequences by a finite automaton. Inform. Control\u00a09, 521\u2013530 (1966)","journal-title":"Inform. Control"},{"key":"21_CR3","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/S0304-3975(98)00191-1","volume":"237","author":"C. Moore","year":"2000","unstructured":"Moore, C., Crutchfield, J.: Quantum automata and quantum grammars Theoretical Computer Science\u00a0237, 275\u2013306 (2000)","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Muller, D.E.: Infinite sequences an finite machines. In: Proc. 4th IEEE Symp. on Switching Circuit Theory and Logical Design, pp. 3\u201316 (1963)","key":"21_CR4","DOI":"10.1109\/SWCT.1963.8"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/1995086","volume":"141","author":"M.O. Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second order theories and automata on infinite trees. Trans. AMS\u00a0141, 1\u201337 (1969)","journal-title":"Trans. AMS"}],"container-title":["Lecture Notes in Computer Science","Unconventional Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13523-1_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:06:15Z","timestamp":1619784375000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13523-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135224","9783642135231"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13523-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}