{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:11:31Z","timestamp":1725484291997},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540431909"},{"type":"electronic","value":"9783540457114"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45711-9_18","type":"book-chapter","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T02:31:39Z","timestamp":1180405899000},"page":"325-353","source":"Crossref","is-referenced-by-count":17,"title":["Rewriting P Systems with Conditional Communication"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Bottoni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Labella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Mart\u00edn-Vide","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gheorghe","family":"P\u0102un","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,2,14]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"D. Angluin, Finding Patterns Common to a Set of Strings, J. Comput. System Sci., 21 (1980), 46\u201362.","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"18_CR2","first-page":"3","volume":"3","author":"P. Bottoni","year":"1998","unstructured":"P. Bottoni, A. Labella, P. Mussio, Gh. P\u0103un, Pattern Control on Derivation in Context-Free Rewriting, J. Automata, Languages, Combinatorics, 3, 1, (1998), 3\u201328.","journal-title":"J. Automata, Languages, Combinatorics"},{"key":"18_CR3","unstructured":"P. Bottoni, C. Martin-Vide, Gh. P\u0103un, G. Rozenberg, Membrane Systems with Promoters\/Inhibitors, submitted, 2000."},{"key":"18_CR4","volume-title":"Computing with Cells and Atoms","author":"C. Calude","year":"2000","unstructured":"C. Calude, Gh. P\u0103un, Computing with Cells and Atoms, Taylor and Francis, London, 2000."},{"key":"18_CR5","unstructured":"J. Castellanos, A. Rodriguez-Paton, Gh. P\u0103un, Computing with Membranes: P Systems with Worm-Objects, IEEE 7th. Intern. Conf. on String Processing and Information Retrieval, SPIRE 2000, La Coruna, Spain, 64\u201374."},{"key":"18_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-74932-2","volume-title":"Regulated Rewriting in Formal Language Theory","author":"J. Dassow","year":"1989","unstructured":"J. Dassow, Gh. P\u0103un, Regulated Rewriting in Formal Language Theory, Springer-Verlag, Berlin, 1989."},{"issue":"1","key":"18_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S012905419300002X","volume":"4","author":"J. Dassow","year":"1993","unstructured":"J. Dassow, Gh. P\u0103un, A. Salomaa, Grammars Based on Patterns, Intern. J. Found. Comput. Sci., 4, 1 (1993), 1\u201314.","journal-title":"Intern. J. Found. Comput. Sci."},{"key":"18_CR8","unstructured":"R. Freund, C. Martin-Vide, Gh. P\u0103un, Computing with Membranes: Three More Collapsing Hierarchies, submitted, 2000."},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"R. Freund, Gh. P\u0103un, On the Number of Non-terminals in Graph-Controlled, Programmed, and Matrix Grammars, submitted, 2000.","DOI":"10.1007\/3-540-45132-3_14"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/BF01178731","volume":"31","author":"D. Hauschild","year":"1994","unstructured":"D. Hauschild, M. Jantzen, Petri Nets Algorithms in the Theory of Matrix Grammars, Acta Informatica, 31 (1994), 719\u2013728.","journal-title":"Acta Informatica"},{"issue":"1","key":"18_CR11","first-page":"1","volume":"77","author":"S.N. Krishna","year":"2000","unstructured":"S.N. Krishna, R. Rama, On the Power of P Systems with Sequential and Parallel Rewriting, Intern. J. Computer Math., 77, 1\u20132 (2000), 1\u201314.","journal-title":"Intern. J. Computer Math."},{"key":"18_CR12","unstructured":"S.N. Krishna, R. Rama, P Systems with Replicated Rewriting, J. Automata, Languages, Conbinatorics, to appear."},{"key":"18_CR13","unstructured":"C. Martin-Vide, Gh. P\u0103un, String Objects in P Systems, Proc. of Algebraic Systems, Formal Languages and Computations Workshop, Kyoto, 2000, RIMS Kokyuroku, Kyoto Univ., 2000."},{"key":"18_CR14","unstructured":"C. Martin-Vide, Gh. P\u0103un, Computing with Membranes. One More Collapsing Hierarchy, Bulletin of the EATCS, 72 (2000)."},{"issue":"2","key":"18_CR15","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1023\/A:1009956010735","volume":"2","author":"V. Mitrana","year":"1999","unstructured":"V. Mitrana, Patterns and Languages. An Overview, Grammars, 2, 2 (1999), 149\u2013173.","journal-title":"Grammars"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1080\/00207168408803399","volume":"15","author":"Gh. P\u0103un","year":"1984","unstructured":"Gh. P\u0103un, Six Nonterminals Are Enough for Generating Each r.e. Language by a Matrix Grammar, Intern. J. Computer Math., 15 (1984), 23\u201337.","journal-title":"Intern. J. Computer Math."},{"issue":"1","key":"18_CR17","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1006\/jcss.1999.1693","volume":"61","author":"Gh. P\u0103un","year":"2000","unstructured":"Gh. P\u0103un, Computing with Membranes, Journal of Computer and System Sciences, 61, 1 (2000), 108\u2013143 (see also Turku Center for Computer Science-TUCS Report No 208, 1998, http:\/\/www.tucs.fi ).","journal-title":"Journal of Computer and System Sciences"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Gh. P\u0103un, Computing with Membranes; Attacking NP-complete Problems, Proc. Second Conf. Unconventional Models of Computing (I. Antoniou, C.S. Calude, M.J. Dinneen, Eds.), Springer-Verlag, 2000.","DOI":"10.1007\/978-1-4471-0313-4_7"},{"volume-title":"Handbook of Formal Languages","year":"1997","key":"18_CR19","unstructured":"G. Rozenberg, A. Salomaa, Eds., Handbook of Formal Languages, Springer-Verlag, Heidelberg, 1997."},{"key":"18_CR20","unstructured":"Cl. Zandron, G. Mauri, Cl. Ferretti, Universality and Normal Forms on Membrane Systems, Proc. Intern. Workshop Grammar Systems 2000 (R. Freund, A. Kelemenova, Eds.), Bad Ischl, Austria, July 2000, 61\u201374."}],"container-title":["Lecture Notes in Computer Science","Formal and Natural Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45711-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T11:39:41Z","timestamp":1556451581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45711-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540431909","9783540457114"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45711-9_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}