{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T12:38:16Z","timestamp":1773405496960,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540732075","type":"print"},{"value":"9783540732082","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73208-2_9","type":"book-chapter","created":{"date-parts":[[2007,9,12]],"date-time":"2007-09-12T07:58:11Z","timestamp":1189583891000},"page":"60-71","source":"Crossref","is-referenced-by-count":4,"title":["Multi-letter Reversible and Quantum Finite Automata"],"prefix":"10.1007","author":[{"given":"Aleksandrs","family":"Belovs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ansis","family":"Rosmanis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juris","family":"Smotrovs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/978-3-540-24749-4_9","volume-title":"STACS 2004","author":"A. Ambainis","year":"2004","unstructured":"Ambainis, A., Beaudry, M., Golovkins, M., Kikusts, A., Mercer, M., Th\u00e9rien, D.: Algebraic results on quantum automata. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 93\u2013104. Springer, Heidelberg (2004)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Freivalds, R.: 1-way quantum finite automata: strengths, weaknesses and generalizations. In: Proceedings of the 39th Annual Symposium on Foundations of Computer Science. pp. 332\u2013341 (1998)","DOI":"10.1109\/SFCS.1998.743469"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45007-6_1","volume-title":"Developments in Language Theory","author":"A. Bertoni","year":"2003","unstructured":"Bertoni, A., Mereghetti, C., Palano, B.: Quantum computing: 1-way quantum automata. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol.\u00a02710, pp. 1\u201320. Springer, Heidelberg (2003)"},{"issue":"5","key":"9_CR4","doi-asserted-by":"publisher","first-page":"1456","DOI":"10.1137\/S0097539799353443","volume":"31","author":"A. Brodsky","year":"2002","unstructured":"Brodsky, A., Pippenger, N.: Characterizations of 1-way quantum finite automata. SIAM Journal on Computing\u00a031(5), 1456\u20131478 (2002) Appeared earlier as Technical Report TR-99-03, University of British Columbia, 1999","journal-title":"SIAM Journal on Computing"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/3-540-44669-9_36","volume-title":"Fundamentals of Computation Theory","author":"M.P. Ciamarra","year":"2001","unstructured":"Ciamarra, M.P.: Quantum reversibility and a new model of quantum automaton. In: Freivalds, R. (ed.) FCT 2001. LNCS, vol.\u00a02138, pp. 376\u2013379. Springer, Heidelberg (2001)"},{"key":"9_CR6","unstructured":"Dzelme, I.: Kvantu autom\u0101ti ar jauktajiem st\u0101vok\u013ciem. Technical Report, University of Latvia (2003)"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/BF00290734","volume":"19","author":"J. Hromkovi\u010d","year":"1983","unstructured":"Hromkovi\u010d, J.: One-way multihead deterministic finite automata. Acta. Informatica\u00a019, 377\u2013384 (1983)","journal-title":"Acta Informatica"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: Kondacs, A., Watrous, J. (eds.) Proceedings of the 38th IEEE Conference on Foundations of Computer Science, pp. 66\u201375 (1997)","DOI":"10.1109\/SFCS.1997.646094"},{"key":"9_CR9","first-page":"97","volume":"237","author":"C. Moore","year":"1997","unstructured":"Moore, C., Crutchfield, J.: Quantum automata and quantum grammars. Theoretical Computer Science\u00a0237, 97\u201397 (1997) Appeared in preprint form as Santa-Fe Institute Working Paper 97-07-062, 1997","journal-title":"Theoretical Computer Science"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Nayak, A.: Optimal lower bounds for quantum automata and random access codes. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pp. 369\u2013377 (1999)","DOI":"10.1109\/SFFCS.1999.814608"},{"key":"9_CR11","unstructured":"Paschen, K.: Quantum finite automata using ancilla qubits. Technical Report,University of Karlsruhe (2000)"},{"key":"9_CR12","first-page":"31","volume-title":"Introduction to the Theory of Computation","author":"M. Sipser","year":"1997","unstructured":"Sipser, M.: Introduction to the Theory of Computation, pp. 31\u201390. PWS, Boston (1997)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73208-2_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T23:29:45Z","timestamp":1737415785000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73208-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540732075","9783540732082"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73208-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}