{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T13:41:31Z","timestamp":1771854091363,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642283314","type":"print"},{"value":"9783642283321","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28332-1_45","type":"book-chapter","created":{"date-parts":[[2012,2,29]],"date-time":"2012-02-29T14:45:36Z","timestamp":1330526736000},"page":"526-537","source":"Crossref","is-referenced-by-count":3,"title":["One-Way Reversible and Quantum Finite Automata with Advice"],"prefix":"10.1007","author":[{"given":"Tomoyuki","family":"Yamakami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Freivalds, R.: 1-way quantum finite automata: strengths, weaknesses, and generalizations. In: FOCS 1998, pp. 332\u2013342 (1998)","DOI":"10.1109\/SFCS.1998.743469"},{"key":"45_CR2","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 J. Comput.\u00a031, 1456\u20131478 (2002)","journal-title":"SIAM J. Comput."},{"key":"45_CR3","first-page":"191","volume":"28","author":"R. Karp","year":"1982","unstructured":"Karp, R., Lipton, R.: Turing machines that take advice. L\u2019Enseignement Math\u00e9matique\u00a028, 191\u2013209 (1982)","journal-title":"L\u2019Enseignement Math\u00e9matique"},{"key":"45_CR4","doi-asserted-by":"crossref","unstructured":"Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: FOCS 1997, pp. 66\u201375 (1997)","DOI":"10.1109\/SFCS.1997.646094"},{"key":"45_CR5","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.ipl.2004.02.005","volume":"90","author":"H. Nishimura","year":"2004","unstructured":"Nishimura, H., Yamakami, T.: Polynomial-time quantum computation with advice. Inf. Process. Lett.\u00a090, 195\u2013204 (2004)","journal-title":"Inf. Process. Lett."},{"key":"45_CR6","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.tcs.2009.08.031","volume":"411","author":"K. Tadaki","year":"2010","unstructured":"Tadaki, K., Yamakami, T., Lin, J.: Theory of one tape linear time Turing machines. Theor. Comput. Sci.\u00a0411, 22\u201343 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"45_CR7","unstructured":"Yamakami, T.: Swapping lemmas for regular and context-free languages (2008), arXiv:0808.4122"},{"key":"45_CR8","doi-asserted-by":"publisher","first-page":"6432","DOI":"10.1016\/j.tcs.2011.07.013","volume":"412","author":"T. Yamakami","year":"2011","unstructured":"Yamakami, T.: Immunity and pseudorandomness of context-free languages. Theor. Comput. Sci.\u00a0412, 6432\u20136450 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"45_CR9","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1142\/S0129054110007659","volume":"21","author":"T. Yamakami","year":"2011","unstructured":"Yamakami, T.: The roles of advice to one-tape linear-time Turing machines and finite automata. Int. J. Found. Comput. Sci.\u00a021, 941\u2013962 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"45_CR10","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.tcs.2004.07.034","volume":"334","author":"T. Yamasaki","year":"2005","unstructured":"Yamasaki, T., Kobayashi, H., Imai, H.: Quantum versus deterministic counter automata. Theor. Comput. Sci.\u00a0334, 275\u2013297 (2005)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28332-1_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T06:19:48Z","timestamp":1742624388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28332-1_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642283314","9783642283321"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28332-1_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}