{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T03:53:02Z","timestamp":1773201182949,"version":"3.50.1"},"reference-count":36,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4855,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,4]]},"DOI":"10.1016\/s0304-3975(98)00191-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:30:39Z","timestamp":1027636239000},"page":"275-306","source":"Crossref","is-referenced-by-count":272,"title":["Quantum automata and quantum grammars"],"prefix":"10.1016","volume":"237","author":[{"given":"Cristopher","family":"Moore","sequence":"first","affiliation":[]},{"given":"James P.","family":"Crutchfield","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00191-1_BIB1","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1126\/science.7973651","article-title":"Molecular computation of solutions to combinatorial problems","volume":"266","author":"Adleman","year":"1994","journal-title":"Science"},{"key":"10.1016\/S0304-3975(98)00191-1_BIB2","doi-asserted-by":"crossref","unstructured":"P. Benioff, Quantum mechanical Hamiltonian models of Turing machines that dissipate no energy, Phys. Rev. Lett. 48 (1982) 1581\u20131585 and J. Statist. Phys. 29 (1982) 515\u2013546.","DOI":"10.1007\/BF01342185"},{"key":"10.1016\/S0304-3975(98)00191-1_BIB3","doi-asserted-by":"crossref","unstructured":"J. Berstel, Transductions and Context-Free Languages, Teubner Studienb\u00fccher, Berlin, 1978.","DOI":"10.1007\/978-3-663-09367-1"},{"key":"10.1016\/S0304-3975(98)00191-1_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","article-title":"On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines","volume":"21","author":"Blum","year":"1989","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(98)00191-1_BIB5","unstructured":"R. Bukharaev, On the representability of events in probabilistic automata, Probab. Meth. Cybernet. V Kazan (1967) 7\u201320 (Russian)."},{"key":"10.1016\/S0304-3975(98)00191-1_BIB6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0304-3975(91)90053-5","article-title":"QRT FIFO automata, breadth-first grammars and their relations","volume":"85","author":"Cherubini","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00191-1_BIB7","doi-asserted-by":"crossref","first-page":"4091","DOI":"10.1103\/PhysRevLett.74.4091","article-title":"Quantum computations with cold trapped ions","volume":"74","author":"Cirac","year":"1995","journal-title":"Phys. Rev. Lett."},{"key":"10.1016\/S0304-3975(98)00191-1_BIB8","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0167-2789(94)90273-9","article-title":"The calculi of emergence: computation, dynamics, and induction","volume":"75","author":"Crutchfield","year":"1994","journal-title":"Physica D"},{"key":"10.1016\/S0304-3975(98)00191-1_BIB9","doi-asserted-by":"crossref","first-page":"10742","DOI":"10.1073\/pnas.92.23.10742","article-title":"The evolution of emergent computation","volume":"92","author":"Crutchfield","year":"1995","journal-title":"Proc. Natl. Acad. Sci."},{"key":"10.1016\/S0304-3975(98)00191-1_BIB10","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1098\/rspa.1985.0070","article-title":"Quantum theory, the Church\u2013Turing principle and the universal quantum computer","volume":"400","author":"Deutsch","year":"1985","journal-title":"Proc. R. Soc. London Ser. A"},{"key":"10.1016\/S0304-3975(98)00191-1_BIB11","doi-asserted-by":"crossref","unstructured":"C. D\u00fcrr, M. Santha, A decision procedure for unitary linear quantum cellular automata, Proc. 37th Symp. on Foundations of Computer Science, 1996, pp. 38\u201345.","DOI":"10.1109\/SFCS.1996.548462"},{"key":"10.1016\/S0304-3975(98)00191-1_BIB12","unstructured":"C.A. Ellis, Probabilistic languages and automata, Ph.D. Thesis, University of Illinois, Urbana, 1969."},{"key":"10.1016\/S0304-3975(98)00191-1_BIB13","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0304-3975(87)90011-9","article-title":"Analytic models and ambiguity of context-free languages","volume":"49","author":"Flajolet","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00191-1_BIB14","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1126\/science.275.5298.350","article-title":"Bulk spin-resonance quantum computation","volume":"275","author":"Gershenfeld","year":"1997","journal-title":"Science"},{"issue":"8","key":"10.1016\/S0304-3975(98)00191-1_BIB15","doi-asserted-by":"crossref","first-page":"2160","DOI":"10.1103\/PhysRevD.24.2160","article-title":"Reconstruction of gauge potentials from Wilson loops","volume":"24","author":"Giles","year":"1981","journal-title":"Phys. Rev. D"},{"key":"10.1016\/S0304-3975(98)00191-1_BIB16","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(98)00191-1_BIB17","doi-asserted-by":"crossref","unstructured":"A. Kondacs, J. Watrous, On the power of quantum finite state automata, Proc. 38th Symp. on Foundations of Computer Science, 1997, To appear.","DOI":"10.1109\/SFCS.1997.646094"},{"key":"10.1016\/S0304-3975(98)00191-1_BIB18","doi-asserted-by":"crossref","unstructured":"W. Kuich, A. Salomaa, Semirings, Automata, Languages, EATCS Monographs on Theoretical Computer Science, vol. 5. Springer, Berlin, 1986.","DOI":"10.1007\/978-3-642-69959-7_2"},{"key":"10.1016\/S0304-3975(98)00191-1_BIB19","doi-asserted-by":"crossref","first-page":"1569","DOI":"10.1126\/science.261.5128.1569","article-title":"A potentially realizable quantum computer","volume":"261","author":"Lloyd","year":"1993","journal-title":"Science"},{"key":"10.1016\/S0304-3975(98)00191-1_BIB20","unstructured":"I. Macarie, Closure properties of stochastic languages, University of Rochester Computer Science Technical Report 441, 1993."},{"key":"10.1016\/S0304-3975(98)00191-1_BIB21","doi-asserted-by":"crossref","unstructured":"C. Moore, Unpredictability and undecidability in dynamical systems, Phys. Rev. Lett. 64 (1990) 2354\u20132357 and Nonlinearity 4 (1991) 199\u2013230.","DOI":"10.1103\/PhysRevLett.64.2354"},{"key":"10.1016\/S0304-3975(98)00191-1_BIB22","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0304-3975(97)00028-5","article-title":"Dynamical recognizers: real-time language recognition by analog computers","volume":"201","author":"Moore","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00191-1_BIB23","series-title":"Introduction to Probabilistic Automata","author":"Paz","year":"1971"},{"key":"10.1016\/S0304-3975(98)00191-1_BIB24","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","article-title":"Probabilistic automata","volume":"6","author":"Rabin","year":"1963","journal-title":"Inform. Control"},{"key":"10.1016\/S0304-3975(98)00191-1_BIB25","unstructured":"El Rodento Diablo, personal communication."},{"key":"10.1016\/S0304-3975(98)00191-1_BIB26","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1145\/321420.321423","article-title":"Real-time definable languages","volume":"14","author":"Rosenberg","year":"1967","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(98)00191-1_BIB27","series-title":"Combinatorial Pattern Matching, 5th Annual Symp.","first-page":"289","article-title":"Recent methods for RNA modeling using stochastic context-free grammars","author":"Sakakibara","year":"1994"},{"key":"10.1016\/S0304-3975(98)00191-1_BIB28","first-page":"579","article-title":"The linguistics of DNA","volume":"80","author":"Searls","year":"1992","journal-title":"Am. Scientist"},{"key":"10.1016\/S0304-3975(98)00191-1_BIB29","doi-asserted-by":"crossref","unstructured":"P.W. Shor, Algorithms for quantum computation: discrete logarithms and factoring, Proc. 35th Symp. on Foundations of Computer Science, 1994, pp. 124\u2013134.","DOI":"10.1109\/SFCS.1994.365700"},{"key":"10.1016\/S0304-3975(98)00191-1_BIB30","doi-asserted-by":"crossref","unstructured":"P.W. Shor, Fault-tolerant quantum computation, Proc. 37th Symp. on Foundations of Computer Science, 1996, pp. 56\u201365.","DOI":"10.1109\/SFCS.1996.548464"},{"key":"10.1016\/S0304-3975(98)00191-1_BIB31","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0304-3975(94)90178-3","article-title":"Analog computation via neural networks","volume":"131","author":"Siegelmann","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00191-1_BIB32","series-title":"Algorithms, Software, Architecture","first-page":"329","article-title":"The complexity of language recognition by neural networks","author":"Siegelmann","year":"1992"},{"key":"10.1016\/S0304-3975(98)00191-1_BIB33","doi-asserted-by":"crossref","first-page":"2252","DOI":"10.1103\/PhysRevLett.78.2252","article-title":"Active stabilization, quantum computation, and quantum state synthesis","volume":"78","author":"Steane","year":"1997","journal-title":"Phys. Rev. Lett."},{"key":"10.1016\/S0304-3975(98)00191-1_BIB34","series-title":"A Modern Approach to Quantum Mechanics","author":"Townsend","year":"1992"},{"key":"10.1016\/S0304-3975(98)00191-1_BIB35","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1016\/S0019-9958(68)90360-4","article-title":"On stochastic languages","volume":"12","author":"Turakainen","year":"1968","journal-title":"Inform. Control"},{"key":"10.1016\/S0304-3975(98)00191-1_BIB36","unstructured":"D.R. Upper, Theory and algorithms for hidden Markov models, and generalized hidden Markov models, Ph.D. Thesis, Mathematics Department, University of California, Berkeley, 1997."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001911?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001911?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T22:11:24Z","timestamp":1580854284000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598001911"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4]]},"references-count":36,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,4]]}},"alternative-id":["S0304397598001911"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00191-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,4]]}}}