{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T04:04:59Z","timestamp":1752984299168},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387708"},{"type":"electronic","value":"9783642387715"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38771-5_9","type":"book-chapter","created":{"date-parts":[[2013,6,9]],"date-time":"2013-06-09T22:16:25Z","timestamp":1370816185000},"page":"82-93","source":"Crossref","is-referenced-by-count":4,"title":["Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Bertoni","sequence":"first","affiliation":[]},{"given":"Christian","family":"Choffrut","sequence":"additional","affiliation":[]},{"given":"Flavio","family":"D\u2019Alessandro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","first-page":"695","volume":"11","author":"A.V. Anisimov","year":"1975","unstructured":"Anisimov, A.V., Seifert, F.D.: Zur algebraischen Charakteristik der durch Kontext-freie Sprachen definierten Gruppen. Elektron. Inform. Verarb. u. Kybern.\u00a011, 695\u2013702 (1975)","journal-title":"Elektron. Inform. Verarb. u. Kybern."},{"key":"9_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-05355-3","volume-title":"Algorithms in Real Algebraic Geometry","author":"S. Basu","year":"2003","unstructured":"Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry. Springer, Berlin (2003)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Bertoni, A., Choffrut, C., D\u2019Alessandro, F.: Quantum finite automata and linear context-free languages, Preprint arXiv:1303.2967 (2013)","DOI":"10.1007\/978-3-642-38771-5_9"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"1464","DOI":"10.1137\/S0097539703425861","volume":"34","author":"V.D. Blondel","year":"2005","unstructured":"Blondel, V.D., Jeandel, E., Koiran, P., Portier, N.: Decidable and Undecidable Problems about Quantum Automata. SIAM J. Comput.\u00a034, 1464\u20131473 (2005)","journal-title":"SIAM J. Comput."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.jsc.2004.11.008","volume":"39","author":"H. Derksen","year":"2005","unstructured":"Derksen, H., Jeandel, E., Koiran, P.: Quantum automata and algebraic groups. J. Symb. Comput.\u00a039, 357\u2013371 (2005)","journal-title":"J. Symb. Comput."},{"key":"9_CR6","unstructured":"Hopcroft, J., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)"},{"key":"9_CR7","unstructured":"Jeandel, E.: Ind\u00e9cidabilit\u00e9 sur les automates quantiques. Master\u2019s thesis. ENS Lyon (2002)"},{"key":"9_CR8","unstructured":"Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pp. 66\u201375 (1997)"},{"key":"9_CR9","doi-asserted-by":"publisher","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. Theoret. Comput. Sci.\u00a0237, 275\u2013306 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Onishchik, A., Vinberg, E.: Lie Groups and Algebraic Groups. Springer, Berlin (1990)","DOI":"10.1007\/978-3-642-74334-4"},{"key":"9_CR11","volume-title":"Introduction to Probabilistic Automata","author":"A. Paz","year":"1971","unstructured":"Paz, A.: Introduction to Probabilistic Automata. Academic Press, New York (1971)"},{"key":"9_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139195218","volume-title":"Elements of Automata Theory","author":"J. Sakarovitch","year":"2009","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Cambridge (2009)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38771-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T20:31:57Z","timestamp":1557779517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38771-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387708","9783642387715"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38771-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}