乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T21:29:12Z","timestamp":1726522152439},"reference-count":28,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"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":3791,"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":[[2003,3]]},"DOI":"10.1016\/s0304-3975(02)00659-x","type":"journal-article","created":{"date-parts":[[2003,2,17]],"date-time":"2003-02-17T16:25:27Z","timestamp":1045499127000},"page":"295-326","source":"Crossref","is-referenced-by-count":339,"title":["Tissue P systems"],"prefix":"10.1016","volume":"296","author":[{"given":"Carlos","family":"Mart\u00edn-Vide","sequence":"first","affiliation":[]},{"given":"Gheorghe","family":"P\u0103un","sequence":"additional","affiliation":[]},{"given":"Juan","family":"Pazos","sequence":"additional","affiliation":[]},{"given":"Alfonso","family":"Rodr\u00edguez-Pat\u00f3n","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1998","series-title":"Essential Cell Biology. An Introduction to the Molecular Biology of the Cell","author":"Alberts","key":"10.1016\/S0304-3975(02)00659-X_BIB1"},{"year":"1987","series-title":"Brains, Machines, and Mathematics","author":"Arbib","key":"10.1016\/S0304-3975(02)00659-X_BIB2"},{"year":"1988","series-title":"The Metaphorical Brain","author":"Arbib","key":"10.1016\/S0304-3975(02)00659-X_BIB3"},{"key":"10.1016\/S0304-3975(02)00659-X_BIB4","first-page":"17","article-title":"Gamma and the chemical abstract reaction model","volume":"Vol. 2235","author":"Banatre","year":"2001"},{"key":"10.1016\/S0304-3975(02)00659-X_BIB5","first-page":"1","article-title":"Connectionist symbol processing","volume":"2","author":"Blank","year":"1999","journal-title":"Neural Comput. Surveys"},{"issue":"5","key":"10.1016\/S0304-3975(02)00659-X_BIB6","first-page":"479","article-title":"The universal grammar as a hypothetical brain","volume":"24","author":"Calude","year":"1979","journal-title":"Rev. Roum. Ling."},{"year":"2000","series-title":"Computing with Cells and Atoms","author":"Calude","key":"10.1016\/S0304-3975(02)00659-X_BIB7"},{"volume":"Vol. 316","year":"1988","key":"10.1016\/S0304-3975(02)00659-X_BIB8"},{"key":"10.1016\/S0304-3975(02)00659-X_BIB9","series-title":"Current Trends in Computer Science","first-page":"781","article-title":"Networks of language processors","author":"Csuhaj-Varju","year":"2001"},{"year":"1994","series-title":"Grammar Systems. A Grammatical Approach to Distribution and Cooperation","author":"Csuhaj-Varju","key":"10.1016\/S0304-3975(02)00659-X_BIB10"},{"key":"10.1016\/S0304-3975(02)00659-X_BIB11","first-page":"67","article-title":"Multiset automata","volume":"Vol. 2235","author":"Csuhaj-Varju","year":"2001"},{"key":"10.1016\/S0304-3975(02)00659-X_BIB12","first-page":"53","article-title":"Systolic tree acceptors","volume":"18","author":"Culik II","year":"1984","journal-title":"RAIRO"},{"year":"1989","series-title":"Regulated Rewriting in Formal Language Theory","author":"Dassow","key":"10.1016\/S0304-3975(02)00659-X_BIB13"},{"key":"10.1016\/S0304-3975(02)00659-X_BIB14","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0166-218X(91)90015-O","article-title":"A note on isomorphic simulation of automata by networks of two-state automata","volume":"30","author":"Esik","year":"1991","journal-title":"Discrete Applied Math."},{"key":"10.1016\/S0304-3975(02)00659-X_BIB15","doi-asserted-by":"crossref","unstructured":"R. Freund, Gh. P\u0103un, On the number of non-terminals in graph-controlled, programmed, and matrix grammars, Proc. of the MCU Conf., Chi\u015fin\u0103u, 2001, Lecture Notes in Computer Science, Vol. 2055, Springer, Berlin, 2001, 214\u2013225.","DOI":"10.1007\/3-540-45132-3_14"},{"year":"1986","series-title":"Products of Automata","author":"Gecseg","key":"10.1016\/S0304-3975(02)00659-X_BIB16"},{"key":"10.1016\/S0304-3975(02)00659-X_BIB17","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1007\/BF01178731","article-title":"Petri nets algorithms in the theory of matrix grammars","volume":"31","author":"Hauschild","year":"1994","journal-title":"Acta Informatica"},{"key":"10.1016\/S0304-3975(02)00659-X_BIB18","doi-asserted-by":"crossref","unstructured":"S.C. Kleene, Representation of events in nerve nets and finite automata, Automata Studies, Princeton Univ. Press, Princeton, N.J., 1956, 2\u201342.","DOI":"10.1515\/9781400882618-002"},{"key":"10.1016\/S0304-3975(02)00659-X_BIB19","unstructured":"M. Kudlek, C. Martin-Vide, Gh. P\u0103un, Toward FMT (Formal Macroset Theory), Pre-proc. of Workshop on Multiset Processing, Curtea de Arge\u015f, Romania, TR 140, CDMTCS, Univ. Auckland, 2000, pp. 149\u2013158."},{"year":"1999","series-title":"The Touchstone of Life. Molecular Information, Cell Communication, and the Foundations of Life","author":"Loewenstein","key":"10.1016\/S0304-3975(02)00659-X_BIB20"},{"key":"10.1016\/S0304-3975(02)00659-X_BIB21","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1142\/S0129054102001424","article-title":"Parallel finite automata systems communicating by states","volume":"13","author":"Mateescu","year":"2002","journal-title":"Intern. J. Found. Computer Sci."},{"key":"10.1016\/S0304-3975(02)00659-X_BIB22","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF02478259","article-title":"A logical calculus of the ideas immanent in nervous activity","volume":"5","author":"McCulloch","year":"1943","journal-title":"Bull. Math. Biophys."},{"year":"1967","series-title":"Computation","author":"Minsky","key":"10.1016\/S0304-3975(02)00659-X_BIB23"},{"key":"10.1016\/S0304-3975(02)00659-X_BIB24","unstructured":"Ch.P. Papadimitriou, Computational Complexity, Reading, MA, 1994."},{"key":"10.1016\/S0304-3975(02)00659-X_BIB25","doi-asserted-by":"crossref","unstructured":"Gh. P\u0103un, Computing with membranes, J. Computer Syst. Sci. 61(1) (2000) 108\u2013143; see also Turku Center for Computer Science-TUCS Report No. 208, 1998, www.tucs.fi.","DOI":"10.1006\/jcss.1999.1693"},{"key":"10.1016\/S0304-3975(02)00659-X_BIB26","unstructured":"Gh. P\u0103un, Y. Sakakibara, T. Yokomori, P systems on graphs of restricted forms, Publicationes Math. Debrecen, to appear."},{"year":"1980","series-title":"The Mathematical Theory of L Systems","author":"Rozenberg","key":"10.1016\/S0304-3975(02)00659-X_BIB27"},{"volume":"3 volumes","year":"1997","key":"10.1016\/S0304-3975(02)00659-X_BIB28"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750200659X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750200659X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T04:11:12Z","timestamp":1583986272000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439750200659X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S030439750200659X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00659-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}