{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:46:04Z","timestamp":1725860764693},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319409450"},{"type":"electronic","value":"9783319409467"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-40946-7_18","type":"book-chapter","created":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T07:52:20Z","timestamp":1467705140000},"page":"213-223","source":"Crossref","is-referenced-by-count":2,"title":["Looking for Pairs that Hard to Separate: A Quantum Approach"],"prefix":"10.1007","author":[{"given":"Aleksandrs","family":"Belovs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Andres","family":"Montoya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abuzer","family":"Yakary\u0131lmaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,6]]},"reference":[{"issue":"1","key":"18_CR1","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0304-3975(02)00138-X","volume":"287","author":"A Ambainis","year":"2002","unstructured":"Ambainis, A., Watrous, J.: Two-way finite automata with quantum and classical states. Theor. Comput. Sci. 287(1), 299\u2013311 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR2","unstructured":"Ambainis, A., Yakary\u0131lmaz, A.: Automata: from mathematics to applications. In: Automata and Quantum Computing (to appear). arXiv:1507.01988"},{"key":"18_CR3","unstructured":"Belovs, A., Montoya, J.A., Yakary\u0131lmaz, A.: Can one quantum bit separate any pair of words with zero-error? Technical report (2016). arXiv:1602.07967"},{"key":"18_CR4","first-page":"151","volume":"29","author":"A Borel","year":"1983","unstructured":"Borel, A.: On free subgroups of semisimple groups. L\u2019Enseignement Math\u00e9matique 29, 151\u2013164 (1983)","journal-title":"L\u2019Enseignement Math\u00e9matique"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/978-3-642-22600-7_12","volume-title":"Descriptional Complexity of Formal Systems","author":"ED Demaine","year":"2011","unstructured":"Demaine, E.D., Eisenstat, S., Shallit, J., Wilson, D.A.: Remarks on separating words. In: Holzer, M. (ed.) DCFS 2011. LNCS, vol. 6808, pp. 147\u2013157. Springer, Heidelberg (2011)"},{"key":"18_CR6","unstructured":"D\u00edaz-Caro, A., Yakary\u0131lmaz, A.: Affine computation and affine automaton. In: Computer Science - Theory and Applications. LNCS, vol. 9691, pp. 1\u201315. Springer (2016). arXiv:1602.04732"},{"issue":"5","key":"18_CR7","doi-asserted-by":"crossref","first-page":"1553","DOI":"10.1512\/iumj.2014.63.5391","volume":"63","author":"A Elkasapy","year":"2014","unstructured":"Elkasapy, A., Thom, A.: About Got\u00f4\u2019s method showing surjectivity of word maps. Indiana Univ. Math. J. 63(5), 1553\u20131565 (2014). arXiv:1207.5596","journal-title":"Indiana Univ. Math. J."},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"P Goral\u010d\u00edk","year":"1986","unstructured":"Goral\u010d\u00edk, P., Koubek, V.: On discerning words by automata. In: Kott, L. (ed.) Automata, Languages and Programming. LNCS, vol. 226. Springer, Heidelberg (1986)"},{"issue":"1","key":"18_CR9","doi-asserted-by":"crossref","first-page":"70","DOI":"10.4018\/jncr.2010010104","volume":"1","author":"M Hirvensalo","year":"2010","unstructured":"Hirvensalo, M.: Quantum automata with open time evolution. Int. J. Nat. Comput. 1(1), 70\u201385 (2010)","journal-title":"Int. J. Nat. Comput."},{"issue":"1\u20132","key":"18_CR10","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.P.: Quantum automata and quantum grammars. Theor. Comput. Sci. 237(1\u20132), 275\u2013306 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511976667","volume-title":"Quantum Computation and Quantum Information","author":"M Nielsen","year":"2010","unstructured":"Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information, 10th edn. Cambridge University Press, Cambridge (2010)","edition":"10"},{"issue":"4","key":"18_CR12","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0020-0190(89)90215-9","volume":"30","author":"JM Robson","year":"1989","unstructured":"Robson, J.M.: Separating strings with small automata. Inf. Process. Lett. 30(4), 209\u2013214 (1989)","journal-title":"Inf. Process. Lett."},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","first-page":"208","volume-title":"Computing with New Resources","author":"ACC Say","year":"2014","unstructured":"Say, A.C.C., Yakary\u0131lmaz, A.: Quantum finite automata: a modern introduction. In: Calude, C.S., Freivalds, R., Kazuo, I. (eds.) Gruska Festschrift. LNCS, vol. 8808, pp. 208\u2013222. Springer, Heidelberg (2014)"},{"issue":"2","key":"18_CR14","doi-asserted-by":"crossref","first-page":"424","DOI":"10.4153\/CMB-2011-155-3","volume":"56","author":"A Thom","year":"2013","unstructured":"Thom, A.: Convergent sequences in discrete groups. Can. Math. Bull. 56(2), 424\u2013433 (2013). arXiv:1003.4093","journal-title":"Can. Math. Bull."},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"Unconventional Computation and Natural Computation","author":"M Villagra","year":"2015","unstructured":"Villagra, M., Yakary\u0131lmaz, A.: Language recognition power and succintness of affine automata. In: Calude, C.S., Dinneen, M.J. (eds.) UCNC 2015. LNCS, vol. 9252. Springer, Heidelberg (2015)"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Yakary\u0131lmaz, A., Montoya, J.A.: On discerning strings with finite automata. In: 2015 Latin American Computing Conference, pp. 1\u20135. IEEE (2015)","DOI":"10.1109\/CLEI.2015.7360021"},{"issue":"9&10","key":"18_CR17","first-page":"747","volume":"10","author":"A Yakary\u0131lmaz","year":"2010","unstructured":"Yakary\u0131lmaz, A., Say, A.C.C.: Languages recognized by nondeterministic quantum finite automata. Quantum Inf. Comput. 10(9&10), 747\u2013770 (2010)","journal-title":"Quantum Inf. Comput."},{"issue":"6","key":"18_CR18","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1016\/j.ic.2011.01.008","volume":"279","author":"A Yakary\u0131lmaz","year":"2011","unstructured":"Yakary\u0131lmaz, A., Say, A.C.C.: Unbounded-error quantum computation with small space bounds. Inf. Comput. 279(6), 873\u2013892 (2011)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40946-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T13:50:48Z","timestamp":1498312248000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40946-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319409450","9783319409467"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40946-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}