{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T04:11:53Z","timestamp":1752984713761},"reference-count":6,"publisher":"World Scientific Pub Co Pte Lt","issue":"08","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2014,12]]},"abstract":"<jats:p> We consider the so-called measure once finite quantum automata model introduced by Moore and Crutchfield in 2000. We show that given a language recognized by such a device and a linear context-free language, it is decidable whether or not they have a nonempty intersection. This extends a result of Blondel et al. which can be interpreted as solving the problem with the free monoid in place of the family of linear context-free languages. <\/jats:p>","DOI":"10.1142\/s0129054114400243","type":"journal-article","created":{"date-parts":[[2015,2,25]],"date-time":"2015-02-25T06:32:14Z","timestamp":1424845934000},"page":"1065-1081","source":"Crossref","is-referenced-by-count":3,"title":["ON THE DECIDABILITY OF THE INTERSECTION PROBLEM FOR QUANTUM AUTOMATA AND CONTEXT-FREE LANGUAGES"],"prefix":"10.1142","volume":"25","author":[{"given":"ALBERTO","family":"BERTONI","sequence":"first","affiliation":[{"name":"Dipartimento di Scienze dell\u2019Informazione, Universit\u00e0 degli Studi di Milano, Via Comelico 39, Milano, 20135, Italy"}]},{"given":"CHRISTIAN","family":"CHOFFRUT","sequence":"additional","affiliation":[{"name":"Laboratoire LIAFA, Universit\u00e9 de Paris 7, 2, pl. Jussieu Paris, 75251 Paris Cedex 05, France"}]},{"given":"FLAVIO","family":"D\u2019ALESSANDRO","sequence":"additional","affiliation":[{"name":"Dipartimento di Matematica, La Sapienza Universit\u00e0 di Roma, Piazzale A. Moro, 2, Roma, 00185, Italy"}]}],"member":"219","published-online":{"date-parts":[[2015,2,24]]},"reference":[{"key":"p_1","first-page":"695","volume":"11","author":"Anisimov A. V.","year":"1975","journal-title":"Kybern."},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45007-6_1"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38771-5_9"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703425861"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2004.11.008"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00191-1"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054114400243","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:14:12Z","timestamp":1565190852000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054114400243"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12]]},"references-count":6,"journal-issue":{"issue":"08","published-online":{"date-parts":[[2015,2,24]]},"published-print":{"date-parts":[[2014,12]]}},"alternative-id":["10.1142\/S0129054114400243"],"URL":"https:\/\/doi.org\/10.1142\/s0129054114400243","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12]]}}}