[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"_public_publisher_byId_67a8868b-bf79-4b91-866a-844e46e5dc28":3,"_public_publication_all{\"sortAscending\":false,\"sortField\":\"updateTime\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"publisherId:67a8868b-bf79-4b91-866a-844e46e5dc28,\"}":96},{"code":4,"data":5,"meta":20},"SUCCESS",{"id":6,"createTime":7,"updateTime":8,"relativeEntities":9,"slug":10,"properties":11,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":22,"manageAffiliations":35,"indexDatabases":51,"url":87,"thumbnailPath":20,"statistic":88,"gsStatistic":20,"type":95,"analyzePriority":20},"67a8868b-bf79-4b91-866a-844e46e5dc28","2024-04-11T05:08:34.682+00:00","2025-11-21T09:49:36.697+00:00",[],"Journal-of-Membrane-Computing",{"issn":12,"title":14,"eissn":16},{"VOID":13},"2523-8914",{"EN":15},"Journal of Membrane Computing",{"VOID":17},"2523-8906","PUBLISHER","PENDING",null,0,[23,29],{"id":24,"createTime":20,"updateTime":20,"relativeEntities":25,"label":26,"description":28,"parentId":20,"standard":20,"scholarHubFieldId":20},"e8c4e2fa-b139-4154-a158-595bd93d381c",[],{"EN":27},"Computational Theory and Mathematics",{},{"id":30,"createTime":20,"updateTime":20,"relativeEntities":31,"label":32,"description":34,"parentId":20,"standard":20,"scholarHubFieldId":20},"ee33e266-088e-4829-aa2f-5ea59917dac0",[],{"EN":33},"Applied Mathematics",{},[36,44],{"id":37,"createTime":20,"updateTime":20,"relativeEntities":38,"slug":20,"properties":39,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":42,"statistic":20},"6b6d67d8-1887-4ca8-86c5-a38f66f10928",[],{"title":40},{"EN":41},"Springer Verlag",[43],"9a7c7208-b28a-42c2-a634-5a7f90eee3ab",{"id":45,"createTime":20,"updateTime":20,"relativeEntities":46,"slug":20,"properties":47,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":50,"statistic":20},"8e7fce10-23c9-4f81-8998-abcf28ea16a0",[],{"title":48},{"EN":49},"Springer Nature",[43],[52,70],{"id":53,"indexDatabase":54,"url":64,"indexYears":65,"academicFieldIds":66,"indexDatabaseRanking":69},"50d53904-b44b-4445-bf92-be191f246af6",{"id":55,"createTime":20,"updateTime":20,"relativeEntities":56,"label":57,"description":59,"key":61,"publicationTags":62,"standard":20},"3c7051d4-eb7d-4c57-a56b-36fc74c5d1e9",[],{"EN":58,"VI":58},"Scopus - Elsevier",{"EN":58,"VI":60},"Cơ sở dữ liệu Scopus thuộc Elsevier","scopus",[63],"SCOPUS","https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F21101048368","2019-2025",[67,68],"bccef185-f7d5-4f2e-881a-2dc383ea6c57","f58e9119-c14c-473f-8a7c-5a035e4ab69a","NONE",{"id":71,"indexDatabase":72,"url":84,"indexYears":20,"academicFieldIds":85,"indexDatabaseRanking":20},"1ac85400-5c6a-4470-8f68-037cc804c406",{"id":73,"createTime":20,"updateTime":20,"relativeEntities":74,"label":75,"description":77,"key":80,"publicationTags":81,"standard":20},"88bab0f7-443b-476c-a72a-7fa5222da393",[],{"EN":76,"VI":76},"ISI\u002FESCI  - Emerging Sources Citation Index",{"EN":78,"VI":79},"ESCI database","Cơ sở dữ liệu ESCI","esci",[82,83],"ESCI","ISI","https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=2523-8906",[86],"874c55e0-262a-4246-b3d1-85e02c3c09db","https:\u002F\u002Flink.springer.com\u002Fjournal\u002F41965",{"impactFactor":21,"impactFactorByYear":89,"i10Index":21,"i10IndexLast5Year":21,"totalPublication":90,"totalPublicationByYear":91,"totalCitation":21,"totalCitationByYear":93,"totalCitationPerPublication":21,"totalCitationPerPublicationByYear":94,"hindexLast5Year":21,"hindex":21},{},2,{"2020":92,"2021":92},1,{},{},"JOURNAL",{"meta":97,"data":99},{"total":98},"95",[100,216,469,584,669,795,912,1026,1113,1198],{"id":101,"createTime":102,"updateTime":103,"relativeEntities":104,"slug":105,"properties":106,"entityType":117,"verifyStatus":118,"verifyTime":119,"verifyNote":120,"languages":20,"translateLanguages":20,"viewCount":21,"primaryUrl":121,"fullTextUrl":20,"authors":122,"publicationType":154,"publisherRelationship":155,"citationCount":207,"citationInfo":208,"publishDate":212,"publishYear":209,"citationAnalyzeStatus":19,"lastCitationAnalyze":213,"indexDatabases":214,"openAccess":20,"references":20,"isForceReanalyzing":215},"5ab18f17-baf3-4899-808e-e755bf222c7f","2023-11-28T06:39:43.661+00:00","2026-04-27T01:30:30.758+00:00",[],"Simulating-reversible-computation-with-reaction-systems",{"abstract":107,"title":109,"gsPaper":111,"references":113,"doi":115},{"EN":108},"Reaction systems are a formal model of computation providing a framework for investigating biochemical reactions inside living cells. We look at the functioning of these systems as a process producing a series of different possible sets of entities representing states which can be changed by the application of reactions, and we study reversibility and its simulation in this framework. Our goal is to establish an Undo-Redo-Do-like semantics of reversibility with environmental control over the direction of the computation following a so-called no-memory approach, that is, without introducing modifications to the model of reaction systems itself. We first establish requirements the systems must satisfy in order to produce processes consisting of states with unique predecessors, then define reversible reaction systems in terms of reversible interactive processes. For such reversible systems, we also construct simulator systems that can traverse between the states of reversible interactive processes back and forth based on the input of a special “rollback” symbol from the environment.",{"EN":110},"Simulating reversible computation with reaction systems",{"VOID":112},"[\"10028838979251233248\"]",{"VOID":114},"Agrigoroaiei, O., & Ciobanu, G. (2008) Dual P systems. In: D.W. Corne, P. Frisco, G. Paun, G. Rozenberg, A. Salomaa (eds.) Membrane Computing - 9th International Workshop, WMC 2008, Edinburgh, UK, July 28–31, 2008, Revised Selected and Invited Papers, Lecture Notes in Computer Science, vol. 5391, pp. 95–107. Springer. https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-540-95885-7_7.\nAgrigoroaiei, O., & Ciobanu, G. (2010). Reversing computation in membrane systems. The Journal of Logical and Algebraic Methods in Programming, 79(3–5), 278–288. https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.jlap.2010.03.003.\nAlhazov, A., Freund, R., & Morita, K. (2012). Sequential and maximally parallel multiset rewriting: Reversibility and determinism. Search Results, 11(1), 95–106. https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs11047-011-9267-8.\nAman, B., & Ciobanu, G. (2017). Reversibility in parallel rewriting systems. Journal of Universal Computer Science, 23(7), 692–703.\nAman, B., & Ciobanu, G. (2018). Controlled reversibility in reaction systems. In M. Gheorghe, G. Rozenberg, A. Salomaa, & C. Zandron (Eds.), Membrane computing (pp. 40–53). Cham: Springer International Publishing.\nAman, B., Ciobanu, G., Glück, R., Kaarsgaard, R., Kari, J., Kutrib, M., et al. (2020). Foundations of reversible computation (pp. 1–40)., Lecture notes in computer science Cham: Springer International Publishing. https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-030-47361-7_1.\nAxelsen, H. B., & Glück, R. (2016). On reversible turing machines and their function universality. Acta Informatica, 53(5), 509–543. https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs00236-015-0253-y.\nBennett, C. H. (1973). Logical reversibility of computation. IBM Journal of Research and Development, 17(6), 525–532.\nBrijder, R., Ehrenfeucht, A., Main, M., & Rozenberg, G. (2011). A tour of reaction systems. International Journal of Foundations of Computer Science, 22, 1499–1517. https:\u002F\u002Fdoi.org\u002F10.1142\u002FS0129054111008842.\nDanos, V., & Krivine, J. (2004) Reversible Communicating Systems. In: P. Gardner, N. Yoshida (eds.) CONCUR 2004 - Concurrency Theory, Lecture Notes in Computer Science, pp. 292–307. Springer, Berlin, Heidelberg . https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-540-28644-8_19.\nDanos, V., & Krivine, J. (2005) Transactions in RCCS. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005 - Concurrency Theory, 16th International Conference, CONCUR 2005, San Francisco, CA, USA, August 23-26, 2005, Proceedings, Lecture Notes in Computer Science, vol. 3653, pp. 398–412. Springer . https:\u002F\u002Fdoi.org\u002F10.1007\u002F11539452_31.\nEhrenfeucht, A., & Rozenberg, G. (2007). Reaction systems. Fundamenta Informaticae, 75(1–4), 263–280.\nFrank, M.P. (2005) Introduction to reversible computing: Motivation, progress, and challenges. In: Proceedings of the 2nd Conference on Computing Frontiers, CF ’05, p. 385–390. Association for Computing Machinery, New York, NY, USA . https:\u002F\u002Fdoi.org\u002F10.1145\u002F1062261.1062324.\nHolzer, M., & Kutrib, M. (2017) Reversible nondeterministic finite automata. In: I. Phillips, H. Rahaman (eds.) Reversible Computation, pp. 35–51. Springer International Publishing, Cham . https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-59936-6_3.\nIbarra, O. H. (2011). On strong reversibility in P systems and related problems. International Journal of Foundations of Computer Science, 22(1), 7–14. https:\u002F\u002Fdoi.org\u002F10.1142\u002FS0129054111007782.\nKari, L., & Rozenberg, G. (2008). The many facets of natural computing. Communications of the ACM, 51, 72–83. https:\u002F\u002Fdoi.org\u002F10.1145\u002F1400181.1400200.\nLandauer, R. (1961). Irreversibility and heat generation in the computing process. IBM Journal of Research and Development, 5(3), 183–191.\nLanese, I., Mezzina, C.A., & Stefani, J.B. (2013) Controlled Reversibility and Compensations. In: R. Glück, T. Yokoyama (eds.) Reversible Computation, Lecture Notes in Computer Science, pp. 233–240. Springer, Berlin, Heidelberg . https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-642-36315-3_19.\nLanese, I., Mezzina, C. A., & Tiezzi, F. (2014). Causal-consistent reversibility. Bulletin-European Association for Theoretical Computer Science, 114, p. 17.\nLanese, I., & Rawski, M. (eds.) (2020) Reversible Computation: 12th International Conference, RC 2020, Oslo, Norway, July 9-10, 2020, Proceedings. Programming and Software Engineering. Springer International Publishing . https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-030-52482-1.\nMeski, A., Penczek, W., & Rozenberg, G. (2015). Model checking temporal properties of reaction systems. The Journal of Information Science, 313, 22–42. https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.ins.2015.03.048.\nMorita, K. (2017). Theory of Reversible Computing. Springer, Japan,. https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-4-431-56606-9.\nNishida, T.Y. (2009). Reversible p systems with symport\u002Fantiport rules. In: G. Paun, M. Pérez-Jiménez, A. Riscos-Núñez (eds.) Proceedings of the 10th Workshop on Membrane Computing, WMC 10, pp. 452–460.\nPaun, G. (2000). Computing with membranes. Journal of Computer and System Sciences, 61(1), 108–143. https:\u002F\u002Fdoi.org\u002F10.1006\u002Fjcss.1999.1693.\nPaun, G., Rozenberg, G., & Salomaa, A. (Eds.). (2010). The Oxford handbook of membrane computing. Oxford: Oxford University Press Inc.\nPerumalla, K.S. (2013). Introduction to Reversible Computing. Chapman & Hall\u002FCRC. Computational Science Series. Boca Raton: CRC Press.\nPhillips, I., Ulidowski, I., & Yuen, S.(2013). A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway. In: R. Glück, T. Yokoyama (eds.) Reversible Computation, Lecture Notes in Computer Science, pp. 218–232. Springer, Berlin, Heidelberg. https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-642-36315-3_18.\nPinna, M.G. (2018). Reversing steps in membrane systems computations. In: M. Gheorghe, G. Rozenberg, A. Salomaa, C. Zandron (eds.) Membrane Computing, Lecture Notes in Computer Science, pp. 245–261. Springer International Publishing, Cham. https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-73359-3_16.\nRozenberg, G., Bäck, T., & Kok, J. N. (2012). Handbook of natural computing. Berlin, Heidelberg: Springer. https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-540-92910-9.\nUlidowski, I., Lanese, I., Schultz, U.P., & Ferreira, C. (eds.): (2020). Reversible Computation: Extending Horizons of Computing - Selected Results of the COST Action IC1405, Lecture Notes in Computer Science, vol. 12070. Springer. https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-030-47361-7.",{"VOID":116},"10.1007\u002Fs41965-020-00049-9","PUBLICATION","VERIFIED","2024-05-10T08:11:46.573+00:00","Auto Verify","https:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs41965-020-00049-9",[123,139],{"id":124,"sortIndex":21,"researcher":20,"roles":125,"affiliations":127,"properties":136,"displayName":138,"givenName":20,"familyName":20},"0e7cab90-c893-403e-b952-bb7bc50dec7e",[126],"AUTHOR",[128],{"id":129,"sortIndex":21,"affiliation":130,"properties":20},"c9463ee9-1d62-44d5-8f62-daf8296094e5",{"id":129,"createTime":20,"updateTime":20,"relativeEntities":131,"slug":20,"properties":132,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":135,"statistic":20},[],{"title":133},{"VI":134},"Department of Computer Science, Faculty of Informatics, University of Debrecen, Debrecen, Hungary",[],{"title":137},{"VI":138},"Attila Bagossy",{"id":140,"sortIndex":92,"researcher":20,"roles":141,"affiliations":142,"properties":149,"displayName":151,"givenName":20,"familyName":20},"0e7bbaff-e2eb-4ab6-85a6-2fede9c4a478",[126],[143],{"id":129,"sortIndex":21,"affiliation":144,"properties":20},{"id":129,"createTime":20,"updateTime":20,"relativeEntities":145,"slug":20,"properties":146,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":148,"statistic":20},[],{"title":147},{"VI":134},[],{"title":150,"gsAuthor":152},{"VI":151},"György Vaszil",{"VOID":153},"[\"gjEBsbUAAAAJ\"]","ARTICLE",{"url":121,"publisher":156,"properties":202},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":157,"slug":10,"properties":158,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":162,"manageAffiliations":171,"indexDatabases":182,"url":87,"thumbnailPath":20,"statistic":197,"gsStatistic":20,"type":95,"analyzePriority":20},[],{"issn":159,"title":160,"eissn":161},{"VOID":13},{"EN":15},{"VOID":17},[163,167],{"id":24,"createTime":20,"updateTime":20,"relativeEntities":164,"label":165,"description":166,"parentId":20,"standard":20,"scholarHubFieldId":20},[],{"EN":27},{},{"id":30,"createTime":20,"updateTime":20,"relativeEntities":168,"label":169,"description":170,"parentId":20,"standard":20,"scholarHubFieldId":20},[],{"EN":33},{},[172,177],{"id":37,"createTime":20,"updateTime":20,"relativeEntities":173,"slug":20,"properties":174,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":176,"statistic":20},[],{"title":175},{"EN":41},[43],{"id":45,"createTime":20,"updateTime":20,"relativeEntities":178,"slug":20,"properties":179,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":181,"statistic":20},[],{"title":180},{"EN":49},[43],[183,190],{"id":53,"indexDatabase":184,"url":64,"indexYears":65,"academicFieldIds":189,"indexDatabaseRanking":69},{"id":55,"createTime":20,"updateTime":20,"relativeEntities":185,"label":186,"description":187,"key":61,"publicationTags":188,"standard":20},[],{"EN":58,"VI":58},{"EN":58,"VI":60},[63],[67,68],{"id":71,"indexDatabase":191,"url":84,"indexYears":20,"academicFieldIds":196,"indexDatabaseRanking":20},{"id":73,"createTime":20,"updateTime":20,"relativeEntities":192,"label":193,"description":194,"key":80,"publicationTags":195,"standard":20},[],{"EN":76,"VI":76},{"EN":78,"VI":79},[82,83],[86],{"impactFactor":21,"impactFactorByYear":198,"i10Index":21,"i10IndexLast5Year":21,"totalPublication":90,"totalPublicationByYear":199,"totalCitation":21,"totalCitationByYear":200,"totalCitationPerPublication":21,"totalCitationPerPublicationByYear":201,"hindexLast5Year":21,"hindex":21},{},{"2020":92,"2021":92},{},{},{"pages":203,"volume":205},{"VOID":204},"179-193",{"VOID":206},"2",15,{"total":207,"publishYear":209,"statisticByYear":210},2020,{"2020":92,"2021":90,"2022":211,"2023":211,"2024":211,"2025":211},3,"2020-09-08","2026-04-27T01:30:30.757+00:00",[82,63],false,{"id":217,"createTime":218,"updateTime":219,"relativeEntities":220,"slug":221,"properties":222,"entityType":117,"verifyStatus":19,"verifyTime":219,"verifyNote":229,"languages":230,"translateLanguages":20,"viewCount":21,"primaryUrl":232,"fullTextUrl":20,"authors":233,"publicationType":154,"publisherRelationship":314,"citationCount":21,"citationInfo":361,"publishDate":364,"publishYear":362,"citationAnalyzeStatus":19,"lastCitationAnalyze":20,"indexDatabases":365,"openAccess":20,"references":366,"isForceReanalyzing":215},"2f0e48ae-6dfb-4944-b401-ac28cfc30755","2024-04-11T12:10:32.504+00:00","2025-02-24T20:50:20.103+00:00",[],"Speaker-recognition-with-global-information-modelling-of-raw-waveforms",{"title":223,"openalex":225,"doi":227},{"EN":224},"Speaker recognition with global information modelling of raw waveforms",{"VOID":226},"W4392660266",{"VOID":228},"10.1007\u002Fs41965-024-00135-2","Author affiliation is blank",[231],"EN","https:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs41965-024-00135-2",[234,253,270,285,302],{"id":235,"sortIndex":21,"researcher":20,"roles":236,"affiliations":237,"properties":246,"displayName":250,"givenName":20,"familyName":20},"ee5a177a-925e-4360-b910-56fe9c360e4e",[],[238],{"id":239,"sortIndex":21,"affiliation":240,"properties":20},"859163a1-2071-4382-b9f9-9fbee243aa26",{"id":239,"createTime":20,"updateTime":20,"relativeEntities":241,"slug":20,"properties":242,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":245,"statistic":20},[],{"title":243},{"EN":244},"College of Computer Science and Cyber Security, Chengdu University of Technology, Chengdu, 610059, China",[],{"orcid":247,"title":249,"openalex":251},{"VOID":248},"https:\u002F\u002Forcid.org\u002F0000-0001-6366-9834",{"EN":250},"Yujiao Wu",{"VOID":252},"A5032565150",{"id":254,"sortIndex":92,"researcher":20,"roles":255,"affiliations":256,"properties":265,"displayName":267,"givenName":20,"familyName":20},"e4abe888-30ba-4b6c-b3b5-ddca9881b129",[],[257],{"id":258,"sortIndex":21,"affiliation":259,"properties":20},"6b9fa06f-d4f5-4640-8eac-f15f49893786",{"id":258,"createTime":20,"updateTime":20,"relativeEntities":260,"slug":20,"properties":261,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":264,"statistic":20},[],{"title":262},{"VI":263},"School of Nuclear Technology and Automation Engineering, Chengdu University of Technology, Chengdu, 610059, China",[],{"title":266,"openalex":268},{"EN":267},"Jianping Dong",{"VOID":269},"A5086339898",{"id":271,"sortIndex":90,"researcher":20,"roles":272,"affiliations":273,"properties":280,"displayName":282,"givenName":20,"familyName":20},"afd557a0-9845-49fa-8304-8ec1ced7323f",[],[274],{"id":239,"sortIndex":21,"affiliation":275,"properties":20},{"id":239,"createTime":20,"updateTime":20,"relativeEntities":276,"slug":20,"properties":277,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":279,"statistic":20},[],{"title":278},{"EN":244},[],{"title":281,"openalex":283},{"EN":282},"Zulin Fang",{"VOID":284},"A5030426982",{"id":286,"sortIndex":211,"researcher":20,"roles":287,"affiliations":288,"properties":295,"displayName":299,"givenName":20,"familyName":20},"99b20cae-103e-4cac-8005-ab0d1a8ce555",[],[289],{"id":239,"sortIndex":21,"affiliation":290,"properties":20},{"id":239,"createTime":20,"updateTime":20,"relativeEntities":291,"slug":20,"properties":292,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":294,"statistic":20},[],{"title":293},{"EN":244},[],{"orcid":296,"title":298,"openalex":300},{"VOID":297},"https:\u002F\u002Forcid.org\u002F0000-0001-8034-0977",{"EN":299},"Gexiang Zhang",{"VOID":301},"A5083210367",{"id":303,"sortIndex":304,"researcher":20,"roles":305,"affiliations":306,"properties":307,"displayName":311,"givenName":20,"familyName":20},"c7958a6d-85da-4a81-a87f-62b2930d845d",4,[],[],{"orcid":308,"title":310,"openalex":312},{"VOID":309},"https:\u002F\u002Forcid.org\u002F0000-0002-6072-3652",{"EN":311},"Haina Rong",{"VOID":313},"A5025720326",{"url":20,"publisher":315,"properties":20},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":316,"slug":10,"properties":317,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":321,"manageAffiliations":330,"indexDatabases":341,"url":87,"thumbnailPath":20,"statistic":356,"gsStatistic":20,"type":95,"analyzePriority":20},[],{"issn":318,"title":319,"eissn":320},{"VOID":13},{"EN":15},{"VOID":17},[322,326],{"id":24,"createTime":20,"updateTime":20,"relativeEntities":323,"label":324,"description":325,"parentId":20,"standard":20,"scholarHubFieldId":20},[],{"EN":27},{},{"id":30,"createTime":20,"updateTime":20,"relativeEntities":327,"label":328,"description":329,"parentId":20,"standard":20,"scholarHubFieldId":20},[],{"EN":33},{},[331,336],{"id":37,"createTime":20,"updateTime":20,"relativeEntities":332,"slug":20,"properties":333,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":335,"statistic":20},[],{"title":334},{"EN":41},[43],{"id":45,"createTime":20,"updateTime":20,"relativeEntities":337,"slug":20,"properties":338,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":340,"statistic":20},[],{"title":339},{"EN":49},[43],[342,349],{"id":53,"indexDatabase":343,"url":64,"indexYears":65,"academicFieldIds":348,"indexDatabaseRanking":69},{"id":55,"createTime":20,"updateTime":20,"relativeEntities":344,"label":345,"description":346,"key":61,"publicationTags":347,"standard":20},[],{"EN":58,"VI":58},{"EN":58,"VI":60},[63],[67,68],{"id":71,"indexDatabase":350,"url":84,"indexYears":20,"academicFieldIds":355,"indexDatabaseRanking":20},{"id":73,"createTime":20,"updateTime":20,"relativeEntities":351,"label":352,"description":353,"key":80,"publicationTags":354,"standard":20},[],{"EN":76,"VI":76},{"EN":78,"VI":79},[82,83],[86],{"impactFactor":21,"impactFactorByYear":357,"i10Index":21,"i10IndexLast5Year":21,"totalPublication":90,"totalPublicationByYear":358,"totalCitation":21,"totalCitationByYear":359,"totalCitationPerPublication":21,"totalCitationPerPublicationByYear":360,"hindexLast5Year":21,"hindex":21},{},{"2020":92,"2021":92},{},{},{"total":21,"publishYear":362,"statisticByYear":363},2024,{},"2024-03-01",[82,63],[367,371,375,379,383,386,390,394,397,401,405,409,413,417,421,425,429,432,436,440,444,448,452,455,459,462,465],{"id":20,"text":368,"url":20,"identifiers":369},"Kabi, M., Mridha, M. F., Shin, J., Jahan, I., & Ohi, A. Q. (2021). A survey of speaker recognition: Fundamental theories, recognition methods and opportunities. IEEE Access., 9, 79236–79263.",{"doi":370},"10.1109\u002FACCESS.2021.3084299",{"id":20,"text":372,"url":20,"identifiers":373},"Fechner, G.T. (1948). Elements of psychophysics. IEEE Access. 1860.",{"doi":374},"10.1037\u002F11304-026",{"id":20,"text":376,"url":20,"identifiers":377},"Snyder, D., Garcia-Romero, D., Sell, G., Povey, D. & Khudanpur, S. (2018). X-vectors: Robust dnn embeddings for speaker recognition. In 2018 IEEE international conference on acoustics, speech and signal processing (ICASSP)., 5329–5333.",{"doi":378},"10.1109\u002FICASSP.2018.8461375",{"id":20,"text":380,"url":20,"identifiers":381},"Desplanques, B., Thienpondt, J. & Demuynck, K. (2020). Ecapa-tdnn: Emphasized channel attention, propagation and aggregation in tdnn based speaker verification. arXiv., 2005–07143.",{"doi":382},"10.21437\u002FInterspeech.2020-2650",{"id":20,"text":384,"url":20,"identifiers":385},"Chung, J.S., Nagrani, A. & Zisserman, A. (2020). Voxceleb2: Deep speaker recognition. arXiv., 2005–07143.",{},{"id":20,"text":387,"url":20,"identifiers":388},"Cai, W., Chen, J., Zhang, J., & Li, M. (2020). On-the-fly data loader and utterance-level aggregation for speaker and language recognition. IEEE\u002FACM Transactions on Audio, Speech, and Language Processing., 28, 1038–1051.",{"doi":389},"10.1109\u002FTASLP.2020.2980991",{"id":20,"text":391,"url":20,"identifiers":392},"Dehak, N., Kenny, P. J., Dehak, R., Dumouchel, P., & Ouellet, P. (2010). Front-end factor analysis for speaker verification. IEEE Transactions on Audio, Speech and Language Processing, 19(4), 788–798.",{"doi":393},"10.1109\u002FTASL.2010.2064307",{"id":20,"text":395,"url":20,"identifiers":396},"Baevski, A., Zhou, Y., Mohamed, A., & Auli, M. (2020). wav2vec 2.0: A framework for self-supervised learning of speech representations. Advances in Neural Information Processing Systems, 33, 12449–12460.",{},{"id":20,"text":398,"url":20,"identifiers":399},"Sainath, T., Weiss, R.J., Wilson, K., Senior, A.W. & Vinyals, O. (2015). Learning the speech front-end with raw waveform cldnns. Advances in neural information processing systems.",{"doi":400},"10.21437\u002FInterspeech.2015-1",{"id":20,"text":402,"url":20,"identifiers":403},"Ravanelli, M. & Bengio, Y. (2018). Speaker recognition from raw waveform with sincnet. In 2018 IEEE spoken language technology workshop (SLT)., 1021–1028.",{"doi":404},"10.1109\u002FSLT.2018.8639585",{"id":20,"text":406,"url":20,"identifiers":407},"Oglic, D., Cvetkovic, Z., Bell, P. & Renals, S. (2020). A deep 2d convolutional network for waveform-based speech recognition. Interspeech., 1654–1658.",{"doi":408},"10.21437\u002FInterspeech.2020-1870",{"id":20,"text":410,"url":20,"identifiers":411},"Pariente, M., Cornell, S., Deleforge, A. & Vincent, E. (2020). Filterbank design for end-to-end speech separation. In ICASSP 2020-2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)., 6364–6368.",{"doi":412},"10.1109\u002FICASSP40776.2020.9053038",{"id":20,"text":414,"url":20,"identifiers":415},"Jung, J.W., Heo, H.S., Yang, I.H., Shim, H.J. & Yu, H.J. (2018). A complete end-to-end speaker verification system using deep neural networks: From raw signals to verification result. In 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)., 5349–5353.",{"doi":416},"10.1109\u002FICASSP.2018.8462575",{"id":20,"text":418,"url":20,"identifiers":419},"Muckenhirn, H., Doss, M.M. & Marcell, S. (2018). Towards directly modeling raw speech signal for speaker verification using cnns. In 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)., 4884–4888.",{"doi":420},"10.1109\u002FICASSP.2018.8462165",{"id":20,"text":422,"url":20,"identifiers":423},"Zhu, G., Jiang, F. & Duan, Z. (2020). Y-vector: Multiscale waveform encoder for speaker embedding. arXiv, 2010–12951",{"doi":424},"10.21437\u002FInterspeech.2021-1707",{"id":20,"text":426,"url":20,"identifiers":427},"Jung, J.W., Kim, Y.J., Heo, H.S., Lee, B.J., Kwon, Y. & Chung, J.S. (2022). Pushing the limits of raw waveform speaker recognition. arXiv, 2203–08488.",{"doi":428},"10.21437\u002FInterspeech.2022-126",{"id":20,"text":430,"url":20,"identifiers":431},"Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N. & Polosukhin, I. (2017). Attention is all you need. Advances in neural information processing systems, 30.",{},{"id":20,"text":433,"url":20,"identifiers":434},"Zhou, H., Zhang, S., Peng, J., Zhang, S., Li, J., Xiong, H., & Zhang, W. (2021). Informer: Beyond efficient transformer for long sequence time-series forecasting. In Proceedings of the AAAI conference on artificial intelligence, 35(12), 11106–11115.",{"doi":435},"10.1609\u002Faaai.v35i12.17325",{"id":20,"text":437,"url":20,"identifiers":438},"Liu, Z., Lin, Y., Cao, Y., Hu, H., Wei, Y., Zhang, Z. & Guo, B. (2021). Swin transformer: Hierarchical vision transformer using shifted windows. In Proceedings of the IEEE\u002FCVF international conference on computer vision, 10012–10022.",{"doi":439},"10.1109\u002FICCV48922.2021.00986",{"id":20,"text":441,"url":20,"identifiers":442},"Wang, R., Ao, J., Zhou, L., Liu, S., Wei, Z., Ko, T. & Zhang, Y. (2022). Multi-view self-attention based transformer for speaker recognition. In ICASSP 2022-2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 6732–6736.",{"doi":443},"10.1109\u002FICASSP43922.2022.9746639",{"id":20,"text":445,"url":20,"identifiers":446},"Noé, P.G., Parcollet, T. & Morchid, M. (2020). Cgcnn: Complex gabor convolutional neural network on raw speech. In ICASSP 2020-2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 7724–7728.",{"doi":447},"10.1109\u002FICASSP40776.2020.9054220",{"id":20,"text":449,"url":20,"identifiers":450},"Andén, J., & Mallat, S. (2014). Deep scattering spectrum. In IEEE Transactions on Signal Processing., 62(16), 4114–4128.",{"doi":451},"10.1109\u002FTSP.2014.2326991",{"id":20,"text":453,"url":20,"identifiers":454},"Balestriero, R., Cosentino, R., Glotin, H. & Baraniuk, R. (2018). Spline filters for end-to-end deep learning. In International conference on machine learning.PMRL., 364–373.",{},{"id":20,"text":456,"url":20,"identifiers":457},"Jung, J.W., Heo, H.S., Kim, J.H., Shim, H.J. & Yu, H.J. (2019). Rawnet: Advanced end-to-end deep neural network using raw waveforms for text-independent speaker verification. arXiv., 1904–08104.",{"doi":458},"10.21437\u002FInterspeech.2019-1982",{"id":20,"text":460,"url":20,"identifiers":461},"Ba, J.L., Kiros, J.R. & Hinton, G.E. (2016). Layer normalization. arXiv., 1607–06450.",{},{"id":20,"text":463,"url":20,"identifiers":464},"Kingma, D.P. & Ba, J. (2014). Adam: A method for stochastic optimization. In 2018 IEEE spoken language technology workshop (SLT), 1412–6980.",{},{"id":20,"text":466,"url":20,"identifiers":467},"Hoffer, E., Ben-Nun, T., Hubara, I., Giladi, N., Hoefler, T. & Soudry, D. (2020). Augment your batch: Improving generalization through instance repetition. In Proceedings of the IEEE\u002FCVF Conference on Computer Vision and Pattern Recognition, 8129–8138.",{"doi":468},"10.1109\u002FCVPR42600.2020.00815",{"id":470,"createTime":471,"updateTime":472,"relativeEntities":473,"slug":474,"properties":475,"entityType":117,"verifyStatus":118,"verifyTime":472,"verifyNote":120,"languages":20,"translateLanguages":20,"viewCount":21,"primaryUrl":484,"fullTextUrl":20,"authors":485,"publicationType":154,"publisherRelationship":529,"citationCount":20,"citationInfo":20,"publishDate":581,"publishYear":582,"citationAnalyzeStatus":19,"lastCitationAnalyze":20,"indexDatabases":583,"openAccess":20,"references":20,"isForceReanalyzing":215},"2cba2357-7242-4738-b396-e6a8f13775fb","2023-11-30T07:09:31.279+00:00","2025-02-24T03:31:00.981+00:00",[],"Chinese-dialect-tone-s-recognition-using-gated-spiking-neural-P-systems",{"abstract":476,"title":478,"references":480,"doi":482},{"EN":477},"Tone is the changing trend of pitch with time. In Chinese, tone plays an essential role for distinguishing meaning. Chinese dialect’s tone is more complex with Mandarin. In the field of Chinese dialect phonetics research, using human earing to recognize the types of tones is still the main method. So batch processing is not possible. In this paper, we construct a GSNP (gated spiking neural P) model with 2 layers which can process time series data to recognize the tones of Chinese dialects. The average accuracy rate of seven cities’ speech is more than 97%. Even in the case of small training samples, compared with other methods, the GSNP model has simpler structure, higher accuracy and more efficiency. It can not only improve the work efficiency of Chinese dialect field investigation, but also help researchers to screen the sounds with special sounds.",{"EN":479},"Chinese dialect tone’s recognition using gated spiking neural P systems",{"VOID":481},"Liu, F. (1924). Record of Experiments on the Four Tones. Shanghai: Yiqun Publishing House.\nWang, L. (2014). Une Prononciation Chinoise de Po-Pei. Beijing: China Publishing House.\nZhao, Y. (1980). Language Problems. Beijing: The Commercial Press.\nChang, P. C., Sun, S. W., & Chen, S. H. (1990). Mandarin tone recognition by multi-layer perceptron, International Conference on Acoustics.\nZhao, L., Zou, C., & Wu, Z. (2000). A tone recognition method for Continuous Chinese Speech based on continuous distributed HMM. Signal Processing, 16(1), 20–23.\nXie, Z., Miao, Z., & Geng, J. (2010). Tone Recognition of Mandarin Speech using BP Neural Network, 2010 International Conference on Image Analysis and Signal Processing, Beijing.\nFu, D., Li, S., & Wang, S. (2010). Tone recognition based on support vector machine in continuous mandarin Chinese. Computer Science, 37(5), 228–230.\nChao, H., Yang, Z., & Liu, W. (2012). Improved tone modeling by exploiting articulatory features for mandarin speech recognition. Journal of Computer Applications, 33(10), 2939–2944.\nTan, Y., Liu, W., Jiang, W., & Zheng, H. (2015). Integration of articulatory knowledge and voicing features based on DNNHMM for Mandarin speech recognition, International Joint Conference on Neural Networks, IEEE.\nLin, J., Xie, Y., & Zhang, J. (2017). Improving Mandarin Tone Recognition Based on DNN by Combining Acoustic and Articulatory Features. IEEE: International Symposium on Chinese Spoken Language Processing.\nRyant, N., Yuan, J., & Liberman, M. (2014). Mandarin tone classification without pitch tracking, IEEE International Conference on Acoustics. IEEE.\nShen, L., & Wang, W. (2018). Fusion feature based automatic Chinese short tone classification. Technical Acoustics, 37(2), 71–78.\nHowie, J. M. (2009). On the domain of tones in mandarin. Phonetics, 30(3), 129–148.\nZhao, X. (2014). A study of the tone of Chinese vowels recognition based on spectrogram. Changchun: DongBei Normal University.\nLi, Y., Fan, X., & Yang, H. (2017). Application of spectrogram for Mandarins tone recognition. Information’s Communications, 175(7), 89–92.\nRoy, K., Jaiswal, A., & Panda, P. (2019). Towards spike-based machine intelligence with neuromorphic computing. Nature, 575, 607–617.\nZhang, F., Rong, H., Neri, F., & Pérez-Jiménez, M. J. (2014). An optimization spiking neural P system for approximately solving combinatorial optimization problems. International Journal of Neural Systems, 24(5), 1440006–16.\nZhang, G., Rong, H., Paul, P., He, Y., Neri, F., & Pérez-Jiménez, M. J. (2021). A complete arithmetic calculator constructed from spiking neural P systems and its application to information fusion. International Journal of Neural Systems, 31(1), 1–17.\nManca, V., & Bianco, L. (2008). Biological networks in metabolic P systems. Bio Systems, 91(3), 489–498.\nRomero-Campero, F. J., & Pérez-Jiménez, M. J. (2008). Modelling gene expression control using P systems: the Lac Operon, a case study. Biosystems, 91(3), 438–457.\nPerez-Jimenez, M. J., & Romero-Campero, F. J. (2005). A Study of the Robustness of the EGFR Signalling Cascade Using Continuous Membrane Systems. Mechanisms, Symbols, and Models Underlying Cognition, Lecture Notes in Computer Science, 3561.\nNagy, B., & Szegedi, L. (2006). Membrane computing and graphical operating systems. Journal of Universal Computer Science, 12(9), 1312–1331.\nCeterchi, R., Gramatovici, R., Jonoska, N., Subramanian, K. G. (2003). Tissue-like P systems with active membranes for picture generation. Fundamenta Informaticae, 56(4), 311–328.\nEnguix, G. B. (2014). Unstable P Systems: Applications to Linguistics, International Conference on Membrane Computing (vol. 3365, pp. 190–209), Berlin.\nEnguix, G. B., Gramatovici, R. (2004). Parsing with active P automata: Lecture Notes in Computer Science. pp. 31–42.\nYuan, G., & Gu, X. (2010). A Differential Evaluation Based Membrane Computing Algorithm. Shanghai, China: Annual Academic Meeting of Shanghai Society of chemistry and chemical engineering.\nPăun, G., & Păun, R. A. (2005). Membrane computing as a framework for modeling economic processes. Timisoara, Romania: International Symposium on Symbolic Numeric Algorithms for Scientific Computing.\nPăun, G., & Păun, R. (2006). Membrane computing and economics: numerical P systems. Fundamenta Informaticae, 73(1\u002F2), 213–227.\nGuo, D., Xia, H., & Zhou, Y. (2013). A new optimized algorithm for solving nonlinear equations based on membrane computing. Computer Applications and Software, 30(2), 165–167.\nBesozzi, D., Cazzaniga, P., Pescini, D., & Mauri, G. (2008). Modelling metapopulations with stochastic membrane systems. Biosystems, 91(3), 499–514.\nColomer, M., Margalida, A., Sanuy, D., & Pérez-Jiménez, M. J. (2011). A bio-inspired computing model as a new tool for modeling ecosystems: The avian scavengers as a case study. Ecological Modelling, 222(1), 33–47.\nIonescu, M. F., Pun, G., & Yokomori, T. (2006). Spiking neural P systems. Fundamenta Informaticae, 71(2), 279–308.\nPăun, G. (2008). Spiking neural P systems with astrocyte-like control. Journal of UCS, 13(11), 1707–1721.\nPăun, G., & Pan, L. (2009). Spiking neural P systems with anti-spikes. International Journal of Computers Communications and Control, 4(3), 273–282.\nLiu, Y., et al. (2022). Spiking neural P systems with membrane potentials, inhibitory rules, and anti-spikes. Entropy, 834, 1–24.\nPan, L., Păun, G., Zhang, G., & Neri, F. (2017). Spiking neural P systems with communication on request. International Journal of Neural Systems, 27, 1750042.\nDong, J., Zhang, G., Luo, B., Yang, Q., Guo, D., Rong, H., Zhu, M., Zhou, K. (2022). A distributed adaptive optimization spiking neural P system for approximately solving combinatorial optimization problems. Information Sciences, 596, 1–14.\nPeng, H., Yang, J., Wang, J., Wang, T., Sun, Z., Song, X., Luo, X., & Huang, X. (2017). Spiking neural P systems with multiple channels. Neural Networks the Official Journal of the International Neural Network Society, 66.\nPeng, H., Wang, J., Pérez-Jiménez, M. J., & Riscos-Núñez, A. (2019). Dynamic threshold neural P systems. Knowledge-Based Systems, 163(1), 875–884.\nPeng, H., & Wang, J. (2019). Coupled neural P systems. IEEE Transactions on Neural Networks and Learning Systems, 30(6), 1672–1682.\nZhao, S., Zhang, L., Liu, Z., Peng, H., & Wang, J. (2022). ConvSNP: a deep learning model embedded with SNP-like neurons. Journal of Membrane Computing, 4, 87–95.\nPeng, H., Bao, T., Luo, X., Wang, J., & Pérez-Jiménez, M. J. (2020). Dendrite P systems. Neural Networks, 127, 110–120.\nSong, T., Pan, L., & Păun, G. (2014). Spiking neural P systems with rules on synapses. Theoretical Computer Science, 529, 82–95.\nWu, T., Păun, A., Zhang, Z., & Pan, L. (2017). Spiking neural P systems with polarizations. IEEE Transactions on Neural Networks and Learning Systems, 99, 1–12.\nPeng, H., Li, B., Wang, J., Song, X., & Pérez-Jiménez, M. J. (2019). Spiking neural P systems with inhibitory rules. Knowledge-Based Systems, 188, 105064.\nSong, X., Valencia-Cabrera, L., Peng, H., Wang, J., & Pérez-Jiménez, M. J. (2020). Spiking neural P systems with delay on synapses. International Journal of Neural Systems, 31(2), 2050042.\nLiu, Q., Long, L., Peng, H., Wang, J., Yang, Q., Song, X., Riscos-Núñez, A., & Pérez-Jiménez, M. J. (2021). Gated spiking neural P systems for time series forecasting. IEEE Transactions on Neural Networks and Learning Systems 1–10.\nKarpathy, A., Johnson, J., & Li, F. (2015). Visualizing and understanding recurrent networks, https:\u002F\u002Fdoi.org\u002F10.48550\u002FarXiv.1506.02078.",{"VOID":483},"10.1007\u002Fs41965-022-00113-6","https:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs41965-022-00113-6",[486,501,514],{"id":487,"sortIndex":21,"researcher":20,"roles":488,"affiliations":489,"properties":498,"displayName":500,"givenName":20,"familyName":20},"70b74429-c05b-45c1-927f-5f3d4a803f9a",[126],[490],{"id":491,"sortIndex":21,"affiliation":492,"properties":20},"17835a23-2049-477a-bad6-09485fd56f15",{"id":491,"createTime":20,"updateTime":20,"relativeEntities":493,"slug":20,"properties":494,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":497,"statistic":20},[],{"title":495},{"VI":496},"Academy of Management Science, Business School, Shandong Normal University, Jinan, China",[],{"title":499},{"VI":500},"Hongyan Zhang",{"id":502,"sortIndex":92,"researcher":20,"roles":503,"affiliations":504,"properties":511,"displayName":513,"givenName":20,"familyName":20},"a4245b0b-acfd-4560-9420-eaee072ec5a4",[126],[505],{"id":491,"sortIndex":21,"affiliation":506,"properties":20},{"id":491,"createTime":20,"updateTime":20,"relativeEntities":507,"slug":20,"properties":508,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":510,"statistic":20},[],{"title":509},{"VI":496},[],{"title":512},{"VI":513},"Xiyu Liu",{"id":515,"sortIndex":90,"researcher":20,"roles":516,"affiliations":517,"properties":526,"displayName":528,"givenName":20,"familyName":20},"3ebac858-d71f-444a-9223-72bd65b6eb05",[126],[518],{"id":519,"sortIndex":21,"affiliation":520,"properties":20},"b058b67c-bbed-48e7-8869-cb034ff9a238",{"id":519,"createTime":20,"updateTime":20,"relativeEntities":521,"slug":20,"properties":522,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":525,"statistic":20},[],{"title":523},{"VI":524},"School of Chinese Language and Literature, Shandong Normal University, Jinan, China",[],{"title":527},{"VI":528},"Yanmei Shao",{"url":484,"publisher":530,"properties":576},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":531,"slug":10,"properties":532,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":536,"manageAffiliations":545,"indexDatabases":556,"url":87,"thumbnailPath":20,"statistic":571,"gsStatistic":20,"type":95,"analyzePriority":20},[],{"issn":533,"title":534,"eissn":535},{"VOID":13},{"EN":15},{"VOID":17},[537,541],{"id":24,"createTime":20,"updateTime":20,"relativeEntities":538,"label":539,"description":540,"parentId":20,"standard":20,"scholarHubFieldId":20},[],{"EN":27},{},{"id":30,"createTime":20,"updateTime":20,"relativeEntities":542,"label":543,"description":544,"parentId":20,"standard":20,"scholarHubFieldId":20},[],{"EN":33},{},[546,551],{"id":37,"createTime":20,"updateTime":20,"relativeEntities":547,"slug":20,"properties":548,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":550,"statistic":20},[],{"title":549},{"EN":41},[43],{"id":45,"createTime":20,"updateTime":20,"relativeEntities":552,"slug":20,"properties":553,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":555,"statistic":20},[],{"title":554},{"EN":49},[43],[557,564],{"id":53,"indexDatabase":558,"url":64,"indexYears":65,"academicFieldIds":563,"indexDatabaseRanking":69},{"id":55,"createTime":20,"updateTime":20,"relativeEntities":559,"label":560,"description":561,"key":61,"publicationTags":562,"standard":20},[],{"EN":58,"VI":58},{"EN":58,"VI":60},[63],[67,68],{"id":71,"indexDatabase":565,"url":84,"indexYears":20,"academicFieldIds":570,"indexDatabaseRanking":20},{"id":73,"createTime":20,"updateTime":20,"relativeEntities":566,"label":567,"description":568,"key":80,"publicationTags":569,"standard":20},[],{"EN":76,"VI":76},{"EN":78,"VI":79},[82,83],[86],{"impactFactor":21,"impactFactorByYear":572,"i10Index":21,"i10IndexLast5Year":21,"totalPublication":90,"totalPublicationByYear":573,"totalCitation":21,"totalCitationByYear":574,"totalCitationPerPublication":21,"totalCitationPerPublicationByYear":575,"hindexLast5Year":21,"hindex":21},{},{"2020":92,"2021":92},{},{},{"pages":577,"volume":579},{"VOID":578},"284-292",{"VOID":580},"4","2022-11-25",2022,[82,63],{"id":585,"createTime":586,"updateTime":587,"relativeEntities":588,"slug":589,"properties":590,"entityType":117,"verifyStatus":118,"verifyTime":587,"verifyNote":120,"languages":20,"translateLanguages":20,"viewCount":21,"primaryUrl":599,"fullTextUrl":20,"authors":600,"publicationType":154,"publisherRelationship":616,"citationCount":20,"citationInfo":20,"publishDate":667,"publishYear":209,"citationAnalyzeStatus":19,"lastCitationAnalyze":20,"indexDatabases":668,"openAccess":20,"references":20,"isForceReanalyzing":215},"c4f2528a-b0c7-4bf7-b287-88b324fee2e7","2023-12-23T08:07:27.654+00:00","2025-02-22T11:53:20.998+00:00",[],"Computing-with-SN-P-systems-with-I-O-mode",{"abstract":591,"title":593,"references":595,"doi":597},{"EN":592},"P systems were introduced more than two decades ago by Gheorghe Pǎun. They are known as nondeterministic maximally parallel computing models. Most of their variants are proved to be capable of solving NP problems in polynomial time. This work focuses on using neural-like P systems to simulate uniform sequential computing models. In particular, we consider a so-called Spiking Neural P module (SN P module) computing finite-state functions. We define and characterize a so-called (SN) P automatic sequence by SN P modules.",{"EN":594},"Computing with SN P systems with I\u002FO mode",{"VOID":596},"Allouche, J.-P., & Shallit, J. (2003). Automatic sequences: Theory, applications, generalizations. Cambridge: Cambridge Iniversity press.\nCabarle, F.G., Buno, K.C., & Adorna H.N. (2012). Spiking neural P systems generating the Thue-Morse sequnce. In: Pan, L., et al. Pre-proceedings of Asian Conference on Membrane Computing, pp 161-169\nCabarle, F. G. C., Adorna, H. N., & Perez-Jimenez, M. J. (2016). Notes on spiking neural P systems and finite automata. Natural Computing, 15(4), 533–539.\nCarandang, J. P., Villaflores, J. M., Cabarle, F. G., Adorna, H. N., & Martinez-del-Amor, M. A. (2017). CuSNP: Spiking neural P systems simulators in CUDA. Romanian Journal of Information Science and Technology, 20(1), 57–70.\nChen, H., Ionescu, M., Ishdorj, T.-O., Pǎun, A., Pǎun, Gh, & Perez-Jimenez, M. J. (2008). Spiking neural P systems with extended rules: Universality and languages. Natural Computing, 7, 147–166.\nde la Cruz, R. T. A., Cabarle, F. G., & Adorna, H. N. (2019). Generating context-free languages using spiking neural P systems with structural plasticity. Journal of Membrane Computing, 1, 161–177.\nMartínez-del-Amor, M.Á., Orellana-Martín, D., Cabarle, F.G.C., Pérez-Jiménez, M.J., & Adorna, H.N. (2017). Sparse-matrix representation of spiking neural P systems for GPU. Fifteenth Brainstorming Week on Membrane Computing (BWMC2017) Fénix Editora. Sevilla, Spain pp. 161–170.\nIbarra, O. H., Perez-Jimenez, M. J., & Yokomori, T. (2010). On spiking neural P systems. Natural Computing, 9, 475–491.\nIonescu, M., Paun, G., & Yokomori, T. (2006). Spiking neural P systems. Fundamenta Informaticae, 71(2–3), 279–308.\nJimenez, Z. B., Cabarle, F. G. C., de la Cruz, R. T. A., et al. (2019). Matrix representation and simulation algorithm of spiking neural P systems with structural plasticity. Journal of Membrane Computing, 1, 145–160.\nManuel, G.A. (2007) P system and automata. Department of Mathematics Undergraduate Thesis, UPDiliman.\nOchirbat, O., Ishdorj, T., & Cichon, G. (2020). An error-tolerant serial binary full-adder via a spiking neural P system using HP\u002FLP basic neurons. Journal of Membrane Computing, 2, 42–48.\nPan, L., Wu, T., & Zhang, Z. (2006). A bibliography of spiking neural P systems. BULLETIN of the International Membrane Computing Society (I M C S), 1(1), 63–78.\nPǎun, G. (2000). Computing with membranes. Journal of Computer System Sciences, 61(1), 108–143.\nPǎun, G. (2002). Membrane computing—An introduction. Berlin: Springer.\nPǎun, G., Rozenberg, G., & Salomaa, A. (Eds.). (2010). Handbook of membrane computing. Oxford: Oxford University Press.\nSalomaa, A. (1973). Formal languages. Cambridge: Academic Press, Inc.\nSipser, M. (2006). Introduction to the theory of computation (2nd ed.). Boston: Thompson Course tech.\nSong, B., Li, K., Orellana-Martin, D., Valenia-Cabrera, L., & Perez-Jimenez, M. J. (2020). Cell-like P systems with evolutional symport\u002Fantiport rules and membrane creation. Information and Computation,. https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.ic.2020.104542.\nSong, B., Zeng, X., Jiang, M., & Perez-Jimenez, M. J. (2020). Monodirectoonal tissue P systems with promotere. IEEE Transactions on Cybernetics,. https:\u002F\u002Fdoi.org\u002F10.1109\u002FTCYB.2020.3003060.",{"VOID":598},"10.1007\u002Fs41965-020-00059-7","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs41965-020-00059-7",[601],{"id":602,"sortIndex":21,"researcher":20,"roles":603,"affiliations":604,"properties":613,"displayName":615,"givenName":20,"familyName":20},"380f3b8c-6d34-4ad5-b356-470ee9ec1312",[126],[605],{"id":606,"sortIndex":21,"affiliation":607,"properties":20},"c64f5df9-09e6-49bd-bad5-a72dcf140868",{"id":606,"createTime":20,"updateTime":20,"relativeEntities":608,"slug":20,"properties":609,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":612,"statistic":20},[],{"title":610},{"VI":611},"Department of Computer Science (Algorithm and Complexity), University of the Philippines Diliman, Quezon City, Philippines",[],{"title":614},{"VI":615},"Henry N. Adorna",{"url":599,"publisher":617,"properties":663},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":618,"slug":10,"properties":619,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":623,"manageAffiliations":632,"indexDatabases":643,"url":87,"thumbnailPath":20,"statistic":658,"gsStatistic":20,"type":95,"analyzePriority":20},[],{"issn":620,"title":621,"eissn":622},{"VOID":13},{"EN":15},{"VOID":17},[624,628],{"id":24,"createTime":20,"updateTime":20,"relativeEntities":625,"label":626,"description":627,"parentId":20,"standard":20,"scholarHubFieldId":20},[],{"EN":27},{},{"id":30,"createTime":20,"updateTime":20,"relativeEntities":629,"label":630,"description":631,"parentId":20,"standard":20,"scholarHubFieldId":20},[],{"EN":33},{},[633,638],{"id":37,"createTime":20,"updateTime":20,"relativeEntities":634,"slug":20,"properties":635,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":637,"statistic":20},[],{"title":636},{"EN":41},[43],{"id":45,"createTime":20,"updateTime":20,"relativeEntities":639,"slug":20,"properties":640,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":642,"statistic":20},[],{"title":641},{"EN":49},[43],[644,651],{"id":53,"indexDatabase":645,"url":64,"indexYears":65,"academicFieldIds":650,"indexDatabaseRanking":69},{"id":55,"createTime":20,"updateTime":20,"relativeEntities":646,"label":647,"description":648,"key":61,"publicationTags":649,"standard":20},[],{"EN":58,"VI":58},{"EN":58,"VI":60},[63],[67,68],{"id":71,"indexDatabase":652,"url":84,"indexYears":20,"academicFieldIds":657,"indexDatabaseRanking":20},{"id":73,"createTime":20,"updateTime":20,"relativeEntities":653,"label":654,"description":655,"key":80,"publicationTags":656,"standard":20},[],{"EN":76,"VI":76},{"EN":78,"VI":79},[82,83],[86],{"impactFactor":21,"impactFactorByYear":659,"i10Index":21,"i10IndexLast5Year":21,"totalPublication":90,"totalPublicationByYear":660,"totalCitation":21,"totalCitationByYear":661,"totalCitationPerPublication":21,"totalCitationPerPublicationByYear":662,"hindexLast5Year":21,"hindex":21},{},{"2020":92,"2021":92},{},{},{"pages":664,"volume":666},{"VOID":665},"230-245",{"VOID":206},"2020-11-03",[82,63],{"id":670,"createTime":671,"updateTime":672,"relativeEntities":673,"slug":674,"properties":675,"entityType":117,"verifyStatus":118,"verifyTime":672,"verifyNote":120,"languages":20,"translateLanguages":20,"viewCount":21,"primaryUrl":684,"fullTextUrl":20,"authors":685,"publicationType":154,"publisherRelationship":740,"citationCount":20,"citationInfo":20,"publishDate":792,"publishYear":793,"citationAnalyzeStatus":19,"lastCitationAnalyze":20,"indexDatabases":794,"openAccess":20,"references":20,"isForceReanalyzing":215},"3de5462a-8c83-422f-b112-6dcf6f5863a7","2023-12-23T11:12:57.367+00:00","2025-02-19T23:26:57.965+00:00",[],"Networks-of-splicing-processors-simulations-between-topologies",{"abstract":676,"title":678,"references":680,"doi":682},{"EN":677},"Networks of splicing processors are one of the theoretical computational models that take inspiration from nature to efficiently solve problems that our current computational knowledge is not able to. One of the issues restricting\u002Fhindering is practical implementation is the arbitrariness of the underlying graph, since our computational systems usually conform to a predefined topology. We propose simulations of networks of splicing processors having arbitrary underlying graphs by networks whose underlying graphs are of a predefined topology: complete, star, and grid graphs. We show that all of these simulations are time efficient in the meaning that they preserve the time complexity of the original network: each computational step in that network is simulated by a fixed number of computational steps in the new topologic networks. Moreover, these simulations do not modify the order of magnitude of the network size.",{"EN":679},"Networks of splicing processors: simulations between topologies",{"VOID":681},"Arroyo, F., Castellanos, J., Dassow, J., Mitrana, V., & Sanchez-Couso, J. R. (2013). Accepting splicing systems with permitting and forbidding words. Acta Inf., 50, 1–14. https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs00236-012-0169-8\nBordihn, H., Mitrana, V., Păun, A., Păun, M. (2017). Networks of polarized splicing processors. In Theory and Practice of Natural Computing, TPNC 2017, Lecture Notes in Computer Science 10687, 165–177. Springer, Berlin, Heidelberg. https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-71069-3_13\nBordihn, H., Mitrana, V., Negru, M. C., Păun, A., & Păun, M. (2018). Small networks of polarized splicing processors are universal. Natural Computing, 17, 799–809. https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs11047-018-9691-0\nCastellanos, J., Mitrana, V., & Santos, E. (2011). Splicing systems: accepting versus generating. In Models of Computation in Context. CiE 2011, Lecture Notes in Computer Science. Springer, Berlin, Heidelberg, 6735, 41–50. https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-642-21875-0_5\nHead, T. (1987). Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviours. Bull. Math. Biol., 49, 737–759. https:\u002F\u002Fdoi.org\u002F10.1007\u002FBF02481771\nHead, T., Păun, G., & Pixton, D. (1996). Language theory and molecular genetics: Generative mechanisms suggested by DNA recombination. In Handbook of Formal Languages, 2, 295–360. https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-662-07675-0_7\nHead, T. (2011). How the structure of DNA molecules provides tools for computation. In Biology, Computation and Linguistics. Frontiers in Artificial Intelligence and Applications vol. 228, 3–8. IOS Press. https:\u002F\u002Fdoi.org\u002F10.3233\u002F978-1-60750-762-8-3\nHead, T. (2012). Restriction enzymes in language generation and plasmid computing In Biomolecular Information Processing: From Logic Systems to Smart Sensors and Actuators, 245–263. Wiley Online Library. https:\u002F\u002Fdoi.org\u002F10.1002\u002F9783527645480.CH13\nJonoska, N., Păun, G., Rozenberg, G. (Eds.) (2004). Aspects of Molecular Computing. Essays Dedicated to Tom Head on the Occasion of His 70th Birthday, Lecture Notes in Computer Science vol. 2950. Springer, Berlin, Heidelberg. https:\u002F\u002Fdoi.org\u002F10.1007\u002Fb94864\nLoos, R., Manea, F., & Mitrana, V. (2009). On small, reduced, and fast universal accepting networks of splicing processors. Theoretical Computer Science, 410, 406–416. https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.tcs.2008.09.048\nManea, F., Martín-Vide, C., Mitrana, V. (2006). All NP-problems can be solved in polynomial time by accepting networks of splicing processors of constant size. In: DNA Computing. Lecture Notes in Computer Science, vol. 4287, 47–57. Springer, Berlin, Heidelberg. https:\u002F\u002Fdoi.org\u002F10.1007\u002F11925903_4\nManea, F., Martín-Vide, C., & Mitrana, V. (2007). Accepting networks of splicing processors: complexity results. Theoretical Computer Science, 371, 72–82. https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.tcs.2006.10.015\nMitrana, V., Petre, I., & Rogojin, V. (2010). Accepting splicing systems. Theoret. Comput. Sci., 411, 2414–2422. https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.tcs.2010.03.025\nMitrana, V., Păun, A., & Păun, M. (2021). Non-preserving accepting splicing systems. Jounal Automata Languages Combinatorics, 26, 109–124. https:\u002F\u002Fdoi.org\u002F10.25596\u002Fjalc-2021-109\nPăun, G. (1996). On the splicing operation. Discrete Applied Mathematics, 70, 57–79. https:\u002F\u002Fdoi.org\u002F10.1016\u002F0166-218X(96)00101-1\nPăun, G., Rozenberg, G., & Salomaa, A. (1998). DNA computing: New Computing Paradigms. Springer, Berlin, Heidelberg.https:\u002F\u002Fdoi.org\u002F10.1007\u002F3-540-48523-6_9\nRozenberg, G., & Salomaa, A. (1997). Handbook of Formal Languages. Springer, Berlin, Heidelberg.https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-662-07675-0",{"VOID":683},"10.1007\u002Fs41965-023-00120-1","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs41965-023-00120-1",[686,701,716],{"id":687,"sortIndex":21,"researcher":20,"roles":688,"affiliations":689,"properties":698,"displayName":700,"givenName":20,"familyName":20},"97035031-4478-4425-a5f2-c87fa1dbe692",[126],[690],{"id":691,"sortIndex":21,"affiliation":692,"properties":20},"c082cbea-92c2-44ff-b69d-e39e1a69b752",{"id":691,"createTime":20,"updateTime":20,"relativeEntities":693,"slug":20,"properties":694,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":697,"statistic":20},[],{"title":695},{"VI":696},"Department of Software Engineering and Artificial Intelligence, Universidad Complutense de Madrid, Madrid, Spain",[],{"title":699},{"VI":700},"José Angel Sanchez Martín",{"id":702,"sortIndex":92,"researcher":20,"roles":703,"affiliations":704,"properties":713,"displayName":715,"givenName":20,"familyName":20},"0c69d178-bde2-4ec6-8d6f-589ab3906f7b",[126],[705],{"id":706,"sortIndex":21,"affiliation":707,"properties":20},"454092a9-c754-4fc5-bc8f-53bc9663a6af",{"id":706,"createTime":20,"updateTime":20,"relativeEntities":708,"slug":20,"properties":709,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":712,"statistic":20},[],{"title":710},{"VI":711},"Department of Information Systems, Universidad Politecnica de Madrid, Madrid, Spain",[],{"title":714},{"VI":715},"Victor Mitrana",{"id":717,"sortIndex":90,"researcher":20,"roles":718,"affiliations":719,"properties":737,"displayName":739,"givenName":20,"familyName":20},"74fe3dcb-dead-4425-a589-1f4661ac27f4",[126],[720,728],{"id":721,"sortIndex":21,"affiliation":722,"properties":20},"cf826eca-c3d1-425f-bbb3-ebef10137158",{"id":721,"createTime":20,"updateTime":20,"relativeEntities":723,"slug":20,"properties":724,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":727,"statistic":20},[],{"title":725},{"VI":726},"Bioinformatics Department, National Institute for R &D for Biological Sciences, Bucharest, Romania",[],{"id":729,"sortIndex":92,"affiliation":730,"properties":736},"98fff98e-dd96-4d57-9fa3-e44a59a20f42",{"id":729,"createTime":20,"updateTime":20,"relativeEntities":731,"slug":20,"properties":732,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":735,"statistic":20},[],{"title":733},{"VI":734},"Faculty of Administration and Business, University of Bucharest, Bucharest, Romania",[],{},{"title":738},{"VI":739},"Mihaela Păun",{"url":684,"publisher":741,"properties":787},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":742,"slug":10,"properties":743,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":747,"manageAffiliations":756,"indexDatabases":767,"url":87,"thumbnailPath":20,"statistic":782,"gsStatistic":20,"type":95,"analyzePriority":20},[],{"issn":744,"title":745,"eissn":746},{"VOID":13},{"EN":15},{"VOID":17},[748,752],{"id":24,"createTime":20,"updateTime":20,"relativeEntities":749,"label":750,"description":751,"parentId":20,"standard":20,"scholarHubFieldId":20},[],{"EN":27},{},{"id":30,"createTime":20,"updateTime":20,"relativeEntities":753,"label":754,"description":755,"parentId":20,"standard":20,"scholarHubFieldId":20},[],{"EN":33},{},[757,762],{"id":37,"createTime":20,"updateTime":20,"relativeEntities":758,"slug":20,"properties":759,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":761,"statistic":20},[],{"title":760},{"EN":41},[43],{"id":45,"createTime":20,"updateTime":20,"relativeEntities":763,"slug":20,"properties":764,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":766,"statistic":20},[],{"title":765},{"EN":49},[43],[768,775],{"id":53,"indexDatabase":769,"url":64,"indexYears":65,"academicFieldIds":774,"indexDatabaseRanking":69},{"id":55,"createTime":20,"updateTime":20,"relativeEntities":770,"label":771,"description":772,"key":61,"publicationTags":773,"standard":20},[],{"EN":58,"VI":58},{"EN":58,"VI":60},[63],[67,68],{"id":71,"indexDatabase":776,"url":84,"indexYears":20,"academicFieldIds":781,"indexDatabaseRanking":20},{"id":73,"createTime":20,"updateTime":20,"relativeEntities":777,"label":778,"description":779,"key":80,"publicationTags":780,"standard":20},[],{"EN":76,"VI":76},{"EN":78,"VI":79},[82,83],[86],{"impactFactor":21,"impactFactorByYear":783,"i10Index":21,"i10IndexLast5Year":21,"totalPublication":90,"totalPublicationByYear":784,"totalCitation":21,"totalCitationByYear":785,"totalCitationPerPublication":21,"totalCitationPerPublicationByYear":786,"hindexLast5Year":21,"hindex":21},{},{"2020":92,"2021":92},{},{},{"pages":788,"volume":790},{"VOID":789},"108-115",{"VOID":791},"5","2023-04-06",2023,[82,63],{"id":796,"createTime":797,"updateTime":798,"relativeEntities":799,"slug":800,"properties":801,"entityType":117,"verifyStatus":118,"verifyTime":798,"verifyNote":120,"languages":20,"translateLanguages":20,"viewCount":21,"primaryUrl":810,"fullTextUrl":20,"authors":811,"publicationType":154,"publisherRelationship":857,"citationCount":20,"citationInfo":20,"publishDate":909,"publishYear":910,"citationAnalyzeStatus":19,"lastCitationAnalyze":20,"indexDatabases":911,"openAccess":20,"references":20,"isForceReanalyzing":215},"1b8c31f0-0311-45de-b095-46fb248ff0ce","2024-01-15T15:21:23.076+00:00","2025-02-19T02:41:21.970+00:00",[],"P-systems-with-limited-number-of-objects",{"abstract":802,"title":804,"references":806,"doi":808},{"EN":803},"P systems are a model of compartmentalized multiset rewriting inspired by the structure of living cells and the way they function. In this paper, we focus of a variant in P systems in which membranes have limited capacity, i.e., the number of objects they may hold is limited by a fixed bound. This feature corresponds to an important physical property of cellular compartments. We propose several possible semantics of limited capacity and show that one of them allows real-time simulations of partially blind register machines, while the other one allows for obtaining computational completeness.",{"EN":805},"P systems with limited number of objects",{"VOID":807},"Alhazov, A. (2006). P systems without multiplicities of symbol-objects. Information Processing Letters, 100(3), 124–129.\nAlhazov, A., & Freund, R. (2014). P systems with toxic objects. In Gheorghe, M., Rozenberg, G., Salomaa, A., Sosík, P., & Zandron C. (Eds.), Membrane Computing – 15th International Conference, CMC 2014, Prague, Czech Republic, August 20–22, 2014, Revised Selected Papers, volume 8961 of Lecture Notes in Computer Science, pages 99–125. Springer.\nAlhazov, A., & Freund, R. (2014). Length P systems. Fundamenta Informaticae, 134(1–2), 17–37.\nAlhazov, A., Freund, R., & Ivanov, S. (2020). P systems with limited capacity. In David Orellana-Martín, Gheorghe Păun, Agustín Riscos-Núñez, and Ignacio Pérez-Hurtado, editors, Proceedings 18th Brainstorming Week on Membrane Computing, Sevilla, February 4–7, 2020, pages 33–47. RGNC REPORT 1\u002F2020, Research Group on Natural Computing, Universidad de Sevilla.\nAlhazov, A., Freund, R., & Ivanov, S. (2020). P systems with limiting the number of objects in membranes. In Rudolf Freund and Tseren-Onolt Ishdorj, editors, Electronic Proceedings of the International Conference on Membrane Computing 2020 (ICMC 2020), Wien, September 14–17, 2020, pp. 83–98. TU Wien.\nAlhazov, A., Freund, R., & Riscos-Núñez, A. (2006). Membrane division, restricted membrane creation and object complexity in P systems. International Journal of Computer Mathematics, 83(7), 529–547.\nDassow, J., & Păun, Gh. (1989). Regulated Rewriting in Formal Language Theory. Berlin: Springer.\nFreund, R., Kari, L., Oswald, M., & Sosík, P. (2005). Computationally universal P systems without priorities: two catalysts are sufficient. Theoretical Computer Science, 330(2), 251–266.\nFreund, R., & Sosík, P. (2015). On the power of catalytic P systems with one catalyst. In Grzegorz Rozenberg, Arto Salomaa, José M. Sempere, and Claudio Zandron, editors, Membrane Computing – 16th International Conference, CMC 2015, Valencia, Spain, August 17–21, 2015, Revised Selected Papers, volume 9504 of Lecture Notes in Computer Science, pages 137–152. Springer.\nMarvin, L. (1967). Computation. Finite and Infinite Machines. Englewood Cliffs: Prentice Hall.\nPăun, Gh. (2000). Computing with membranes. Journal of Computer and System Sciences, 61(1), 108–143.\nPăun, Gh. (2002). Membrane Computing: An Introduction. Berlin: Springer.\nPăun, Gh., Rozenberg, G., & Salomaa, A. (Eds.). (2010). The Oxford Handbook of Membrane Computing. Oxford: Oxford University Press.\nRozenberg, G., & Salomaa, A. (Eds.). (1997). Handbook of Formal Languages. Berlin: Springer.\nThe P Systems Website. (2019). http:\u002F\u002Fppage.psystems.eu\u002F.",{"VOID":809},"10.1007\u002Fs41965-020-00068-6","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs41965-020-00068-6",[812,827,842],{"id":813,"sortIndex":21,"researcher":20,"roles":814,"affiliations":815,"properties":824,"displayName":826,"givenName":20,"familyName":20},"39c04af7-4399-4d73-9a19-f17af1049c27",[126],[816],{"id":817,"sortIndex":21,"affiliation":818,"properties":20},"0ab65fe9-f0e2-456c-845d-c0d407d41eed",{"id":817,"createTime":20,"updateTime":20,"relativeEntities":819,"slug":20,"properties":820,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":823,"statistic":20},[],{"title":821},{"VI":822},"Vladimir Andrunachievici Institute of Mathematics and Computer Science, Chișinău, Moldova",[],{"title":825},{"VI":826},"Artiom Alhazov",{"id":828,"sortIndex":92,"researcher":20,"roles":829,"affiliations":830,"properties":839,"displayName":841,"givenName":20,"familyName":20},"35da2177-a28f-417f-aacf-2dc008d3fdc9",[126],[831],{"id":832,"sortIndex":21,"affiliation":833,"properties":20},"aa488a8c-2606-4b99-b73d-efd12ccbaa1f",{"id":832,"createTime":20,"updateTime":20,"relativeEntities":834,"slug":20,"properties":835,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":838,"statistic":20},[],{"title":836},{"VI":837},"Faculty of Informatics, TU Wien, Wien, Austria",[],{"title":840},{"VI":841},"Rudolf Freund",{"id":843,"sortIndex":90,"researcher":20,"roles":844,"affiliations":845,"properties":854,"displayName":856,"givenName":20,"familyName":20},"08b4ff45-6484-4ca0-abd5-d7081e004f6a",[126],[846],{"id":847,"sortIndex":21,"affiliation":848,"properties":20},"6910555c-4aab-4958-99ef-9ea595af611a",{"id":847,"createTime":20,"updateTime":20,"relativeEntities":849,"slug":20,"properties":850,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":853,"statistic":20},[],{"title":851},{"VI":852},"IBISC, IBISC, Université Évry, Évry, France",[],{"title":855},{"VI":856},"Sergiu Ivanov",{"url":810,"publisher":858,"properties":904},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":859,"slug":10,"properties":860,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":864,"manageAffiliations":873,"indexDatabases":884,"url":87,"thumbnailPath":20,"statistic":899,"gsStatistic":20,"type":95,"analyzePriority":20},[],{"issn":861,"title":862,"eissn":863},{"VOID":13},{"EN":15},{"VOID":17},[865,869],{"id":24,"createTime":20,"updateTime":20,"relativeEntities":866,"label":867,"description":868,"parentId":20,"standard":20,"scholarHubFieldId":20},[],{"EN":27},{},{"id":30,"createTime":20,"updateTime":20,"relativeEntities":870,"label":871,"description":872,"parentId":20,"standard":20,"scholarHubFieldId":20},[],{"EN":33},{},[874,879],{"id":37,"createTime":20,"updateTime":20,"relativeEntities":875,"slug":20,"properties":876,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":878,"statistic":20},[],{"title":877},{"EN":41},[43],{"id":45,"createTime":20,"updateTime":20,"relativeEntities":880,"slug":20,"properties":881,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":883,"statistic":20},[],{"title":882},{"EN":49},[43],[885,892],{"id":53,"indexDatabase":886,"url":64,"indexYears":65,"academicFieldIds":891,"indexDatabaseRanking":69},{"id":55,"createTime":20,"updateTime":20,"relativeEntities":887,"label":888,"description":889,"key":61,"publicationTags":890,"standard":20},[],{"EN":58,"VI":58},{"EN":58,"VI":60},[63],[67,68],{"id":71,"indexDatabase":893,"url":84,"indexYears":20,"academicFieldIds":898,"indexDatabaseRanking":20},{"id":73,"createTime":20,"updateTime":20,"relativeEntities":894,"label":895,"description":896,"key":80,"publicationTags":897,"standard":20},[],{"EN":76,"VI":76},{"EN":78,"VI":79},[82,83],[86],{"impactFactor":21,"impactFactorByYear":900,"i10Index":21,"i10IndexLast5Year":21,"totalPublication":90,"totalPublicationByYear":901,"totalCitation":21,"totalCitationByYear":902,"totalCitationPerPublication":21,"totalCitationPerPublicationByYear":903,"hindexLast5Year":21,"hindex":21},{},{"2020":92,"2021":92},{},{},{"pages":905,"volume":907},{"VOID":906},"1-9",{"VOID":908},"3","2021-03-04",2021,[82,63],{"id":913,"createTime":914,"updateTime":915,"relativeEntities":916,"slug":917,"properties":918,"entityType":117,"verifyStatus":118,"verifyTime":915,"verifyNote":120,"languages":20,"translateLanguages":20,"viewCount":21,"primaryUrl":927,"fullTextUrl":20,"authors":928,"publicationType":154,"publisherRelationship":973,"citationCount":20,"citationInfo":20,"publishDate":1024,"publishYear":582,"citationAnalyzeStatus":19,"lastCitationAnalyze":20,"indexDatabases":1025,"openAccess":20,"references":20,"isForceReanalyzing":215},"377bb0b9-ae1a-4b26-b042-2c2140014aad","2024-01-26T03:43:41.506+00:00","2025-02-18T12:14:02.868+00:00",[],"Turing-universality-of-sequential-spiking-neural-P-systems-with-polarizations-as-number-accepting-devices",{"abstract":919,"title":921,"references":923,"doi":925},{"EN":920},"To take full advantage of the information transfer mechanism of biological nervous systems, we consider a new computational model of spiking neural P systems with polarizations (PSN P systems). Compared to spiking neural P systems (SN P systems), PSN P systems use more simple formal language rules, and the behavioral changes of each neuron are jointly controlled by the number of spikes and the polarity state (\n                \n                  \n                \n                $$+$$\n                \n              , 0, − charge), making systems also have a powerful distributed parallel computing capability. Following the fact that SN P systems can operate as different modes, we consider the computation power of sequential PSN P systems in the accepting mode. In this work, we prove Turing universality of PSN P systems using the min-sequentiality and max-sequentiality strategies as number accepting devices by simulating the deterministic register machine.",{"EN":922},"Turing universality of sequential spiking neural P systems with polarizations as number accepting devices",{"VOID":924},"Bao, T., Zhou, N., Lv, Z., Peng, H., & Wang, J. (2020). Sequential dynamic threshold neural P systems. Journal of Membrane Computing, 2(4), 255–268.\nBao, T., Zhou, N., Peng, H., Yang, Q., & Wang, J. (2021). Computational completeness of sequential spiking neural P systems with inhibitory rules. Information and Computation, 281, 104786.\nBibi, A., Xu, F., Adorna, H. N., & Cabarle, F. G. C. (2019). Sequential spiking neural P systems with local scheduled synapses without delay. Complexity, 2019, 2.\nCabarle, F. G. C., de la Cruz, R. T. A., Zhang, X., Jiang, M., Liu, X., & Zeng, X. (2018). On string languages generated by spiking neural P systems with structural plasticity. IEEE Transactions on Nanobioscience, 17(4), 560–566.\nChen, H., Freund, R., Ionescu, M., Păun, G., & Pérez-Jiménez, M. J. (2007). On string languages generated by spiking neural P systems. Fundamenta Informaticae, 75(1–4), 141–162.\nde la Cruz, R. T. A., Cabarle, F. G., & Adorna, H. N. (2019). Generating context-free languages using spiking neural P systems with structural plasticity. Journal of Membrane Computing, 1(3), 161–177.\nDíaz-Pernil, D., Gutiérrez-Naranjo, M. A., & Peng, H. (2019). Membrane computing and image processing: a short survey. Journal of Membrane Computing, 1(1), 58–73.\nDíaz-Pernil, D., Peña-Cantillana, F., & Gutiérrez-Naranjo, M. A. (2013). A parallel algorithm for skeletonizing images by using spiking neural P systems. Neurocomputing, 115, 81–91.\nGarcia, L., Sanchez, G., Vazquez, E., Avalos, G., Anides, E., Nakano, M., Sanchez, G., & Perez, H. (2021). Small universal spiking neural P systems with dendritic\u002Faxonal delays and dendritic trunk\u002Ffeedback. Neural Networks, 138, 126–139.\nGerstner, W., & Kistler, W. M. (2002). Spiking Neuron Models. Single Neurons, Populations, Plasticity. Cambridge University Press.\nIbarra, O. H., Păun, A., & Rodríguez-Patón, A. (2009). Sequential SNP systems based on min\u002Fmax spike number. Theoretical Computer Science, 410, 2982–2991.\nIonescu, M., Păun, G., Yokomori, T. (2006). Spiking neural P systems. Fundamenta Informaticae 71(2-3), 279–308\nIshdorj, T. O., Leporati, A., Pan, L., Zeng, X., & Zhang, X. (2010). Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources. Theoretical Computer Science, 411(25), 2345–2358.\nJiang, S., Fan, J., Liu, Y., Wang, Y., & Xu, F. (2020). Spiking neural P systems with polarizations and rules on synapses. Complexity, 2020(1), 1–12.\nLeporati, A., Mauri, G., Zandron, C., Păun, G., & Pérez-Jiménez, M. J. (2009). Uniform solutions to SAT and Subset Sum by spiking neural P systems. Natural Computing, 8(4), 681–702.\nLiu, L., & Jiang, K. (2022). Universality of spiking neural P systems with polarizations working in sequential mode induced by maximum spike number. Journal of Membrane Computing, 4(1), 56–67.\nMaass, W. (1997). Networks of spiking neurons: the third generation of neural network models. Neural Networks, 10(9), 1659–1671.\nMaass, W., & Bishop, C. M. (2001). Pulsed Neural Networks. MIT Press.\nNeary, T. (2015). Three small universal spiking neural P systems. Theoretical Computer Science, 567, 2–20.\nPan, L., & Păun, G. (2009). Spiking neural P systems with anti-spikes. International Journal of Computers, Communications & Control, 4(3), 273–282.\nPan, L., Păun, G., Zhang, G., & Neri, F. (2017). Spiking neural P systems with communication on request. International Journal of Neural Systems, 27(8), 1750042.\nPan, L., & Zeng, X. (2011). Small universal spiking neural P systems working in exhaustive mode. IEEE Transactions on NanoBioscience, 10(2), 99–105.\nPan, T., Shi, X., Zhang, Z., & Xu, F. (2018). A small universal spiking neural P system with communication on request. Neurocomputing, 275, 1622–1628.\nPăun, A., & Păun, G. (2007). Small universal spiking neural P systems. BioSystems, 90(1), 48–60.\nPăun, G. (2000). Computing with membranes. Journal of Computer and System Sciences, 61(1), 108–143.\nPăun, G. (2002). Membrane Computing: An Introduction. Springer-Verlag.\nPăun, G. (2010). A quick introduction to membrane computing. The Journal of Logic and Algebraic Programming, 79(6), 291–294.\nPăun, G., Rozenberg, G., & Salomaa, A. (2010). The Oxford Handbook of Membrane Computing. Oxford University Press.\nPeng, H., Wang, J., Ming, J., Shi, P., Pérez-Jiménez, M. J., Yu, W., & Tao, C. (2017). Fault diagnosis of power systems using intuitionistic fuzzy spiking neural P systems. IEEE Transactions on Smart Grid, 9(5), 4777–4784.\nPeng, H., Wang, J., Pérez-Jiménez, M. J., Wang, H., Shao, J., & Wang, T. (2013). Fuzzy reasoning spiking neural P systems for fault diagnosis. Information Sciences, 235, 106–116.\nRodríguez-Chavarría, D., Gutiérrez-Naranjo, M. A., & Borrego-Díaz, J. (2020). Logic negation with spiking neural P systems. Neural Processing Letters, 52(2), 1583–1599.\nRong, H., Duan, Y., & Zhang, G. (2022). A bibliometric analysis of membrane computing (1998–2019). Journal of Membrane Computing. https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs41965-022-00098-2\nRong, H., Wu, T., Pan, L., & Zhang, G. (2018). Spiking neural P systems: Theoretical results and applications. In C. Graciani, A. Riscos-Núñez, G. Păun, G. Rozenberg, & A. Salomaa (Eds.), Enjoying Natural Computing (Vol. 11270, pp. 256–268). Springer.\nRong, H., Yi, K., Zhang, G., Dong, J., Paul, P., & Huang, Z. (2019). Automatic implementation of fuzzy reasoning spiking neural P systems for diagnosing faults in complex power systems. Complexity, 2019(1), 1–16.\nSong, T., Pan, L., & Păun, G. (2013). Asynchronous spiking neural P systems with local synchronization. Information Sciences, 219, 197–207.\nSong, T., Pan, L., Wu, T., Zheng, P., Wong, M. D., & Rodríguez-Patón, A. (2019). Spiking neural P systems with learning functions. IEEE Transactions on Nanobioscience, 18(2), 176–190.\nSong, T., Pang, S., Hao, S., Rodríguez-Patón, A., & Zheng, P. (2019). A parallel image skeletonizing method using spiking neural P systems with weights. Neural Processing Letters, 50(2), 1485–1502.\nSong, T., Zheng, P., Wong, M. D., & Wang, X. (2016). Design of logic gates using spiking neural P systems with homogeneous neurons and astrocytes-like control. Information Sciences, 372, 380–391.\nSong, X., Valencia-Cabrera, L., Peng, H., Wang, J., & Pérez-Jiménez, M. J. (2020). Spiking neural P systems with delay on synapses. International Journal of Neural Systems, 31(1), 2050042.\nVreeken, J. (2003). Spiking neural networks, an introduction. Utrecht University.\nWang, H., Zhou, K., & Zhang, G. (2018). Arithmetic operations with spiking neural P systems with rules and weights on synapses. International Journal of Computers Communications and Control, 13(4), 574–589.\nWang, J., Peng, H., Yu, W., Ming, J., Pérez-Jiménez, M. J., Tao, C., & Huang, X. (2019). Interval-valued fuzzy spiking neural P systems for fault diagnosis of power transmission networks. Engineering Applications of Artificial Intelligence, 82, 102–109.\nWang, T., Zhang, G., Zhao, J., He, Z., Wang, J., & Pérez-Jiménez, M. J. (2014). Fault diagnosis of electric power systems based on fuzzy reasoning spiking neural P systems. IEEE Transactions on Power Systems, 30(3), 1182–1194.\nWu, T., & Pan, L. (2020). The computation power of spiking neural P systems with polarizations adopting sequential mode induced by minimum spike number. Neurocomputing, 401, 392–404.\nWu, T., Pan, L., & Alhazov, A. (2019). Computation power of asynchronous spiking neural P systems with polarizations. Theoretical Computer Science, 777, 474–489.\nWu, T., Păun, A., Zhang, Z., & Pan, L. (2018). Spiking neural P systems with polarizations. IEEE Transactions on Neural Networks and Learning Systems, 29(8), 3349–3360.\nWu, T., Zhang, L., Lyu, Q., & Jin, Y. (2022). Asynchronous spiking neural P systems with local synchronization of rules. Information Sciences, 588, 1–12.\nWu, T., Zhang, T., & Xu, F. (2020). Simplified and yet turing universal spiking neural P systems with polarizations optimized by anti-spikes. Neurocomputing, 414, 255–266.\nZeng, X., Xu, L., Liu, X., & Pan, L. (2014). On languages generated by spiking neural P systems with weights. Information Sciences, 278, 423–433.\nZhang, G., Pérez-Jiménez, M. J., & Gheorghe, M. (2017). Real-life Applications with Membrane Computing. Springer.\nZhang, G., Rong, H., Neri, F., & Pérez-Jiménez, M. J. (2014). An optimization spiking neural P system for approximately solving combinatorial optimization problems. International Journal of Neural Systems, 24(5), 1440006.\nZhang, G., Rong, H., Paul, P., He, Y., Neri, F., & Pérez-Jiménez, M. J. (2021). A complete arithmetic calculator constructed from spiking neural P systems and its application to information fusion. International Journal of Neural Systems, 31(1), 2050055.\nZhang, X., Zeng, X., & Pan, L. (2008). Smaller universal spiking neural P systems. Fundamenta Informaticae, 87(1), 117–136.\nZhang, X., Zeng, X., & Pan, L. (2009). On languages generated by asynchronous spiking neural P systems. Theoretical Computer Science, 410(26), 2478–2488.\nZhao, J., & Wang, N. (2011). A bio-inspired algorithm based on membrane computing and its application to gasoline blending scheduling. Computers and Chemical Engineering, 35(2), 272–283.\nZhao, Y., Liu, X., & Wang, W. (2016). Spiking neural P systems with neuron division and dissolution. Plos One, 11(9), 0162882.\nZhao, Y., Liu, Y., Liu, X., & Sun, M. (2022). Qi: Self adapting spiking neural P systems with refractory period and propagation delay. Information Sciences, 589(12), 80–93.\nZhu, M., Yang, Q., Dong, J., Zhang, G., Gou, X., Rong, H., et al. (2021). An adaptive optimization spiking neural P system for binary problems. International Journal of Neural Systems, 31(1), 2050054.",{"VOID":926},"10.1007\u002Fs41965-022-00107-4","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs41965-022-00107-4",[929,953],{"id":930,"sortIndex":21,"researcher":20,"roles":931,"affiliations":932,"properties":950,"displayName":952,"givenName":20,"familyName":20},"bbc748c8-efd7-45a4-9bf1-9f52dfcbc592",[126],[933,941],{"id":934,"sortIndex":21,"affiliation":935,"properties":20},"c5a14785-4e12-42fb-92c9-f95ba0942ab2",{"id":934,"createTime":20,"updateTime":20,"relativeEntities":936,"slug":20,"properties":937,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":940,"statistic":20},[],{"title":938},{"VI":939},"The University Key Laboratory of Intelligent Perception and Computing of Anhui Province, Anqing Normal University, Anqing, China",[],{"id":942,"sortIndex":92,"affiliation":943,"properties":949},"86611442-4a2c-4d29-8507-4e812e520ff1",{"id":942,"createTime":20,"updateTime":20,"relativeEntities":944,"slug":20,"properties":945,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":948,"statistic":20},[],{"title":946},{"EN":947},"School of Computer and Information, Anqing Normal University, Anqing, China",[],{},{"title":951},{"VI":952},"Li Liu",{"id":954,"sortIndex":92,"researcher":20,"roles":955,"affiliations":956,"properties":970,"displayName":972,"givenName":20,"familyName":20},"79d48606-f8d6-419b-b5c7-f4c7907a5f14",[126],[957,963],{"id":934,"sortIndex":21,"affiliation":958,"properties":20},{"id":934,"createTime":20,"updateTime":20,"relativeEntities":959,"slug":20,"properties":960,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":962,"statistic":20},[],{"title":961},{"VI":939},[],{"id":942,"sortIndex":92,"affiliation":964,"properties":969},{"id":942,"createTime":20,"updateTime":20,"relativeEntities":965,"slug":20,"properties":966,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":968,"statistic":20},[],{"title":967},{"EN":947},[],{},{"title":971},{"VI":972},"Keqin Jiang",{"url":927,"publisher":974,"properties":1020},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":975,"slug":10,"properties":976,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":980,"manageAffiliations":989,"indexDatabases":1000,"url":87,"thumbnailPath":20,"statistic":1015,"gsStatistic":20,"type":95,"analyzePriority":20},[],{"issn":977,"title":978,"eissn":979},{"VOID":13},{"EN":15},{"VOID":17},[981,985],{"id":24,"createTime":20,"updateTime":20,"relativeEntities":982,"label":983,"description":984,"parentId":20,"standard":20,"scholarHubFieldId":20},[],{"EN":27},{},{"id":30,"createTime":20,"updateTime":20,"relativeEntities":986,"label":987,"description":988,"parentId":20,"standard":20,"scholarHubFieldId":20},[],{"EN":33},{},[990,995],{"id":37,"createTime":20,"updateTime":20,"relativeEntities":991,"slug":20,"properties":992,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":994,"statistic":20},[],{"title":993},{"EN":41},[43],{"id":45,"createTime":20,"updateTime":20,"relativeEntities":996,"slug":20,"properties":997,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":999,"statistic":20},[],{"title":998},{"EN":49},[43],[1001,1008],{"id":53,"indexDatabase":1002,"url":64,"indexYears":65,"academicFieldIds":1007,"indexDatabaseRanking":69},{"id":55,"createTime":20,"updateTime":20,"relativeEntities":1003,"label":1004,"description":1005,"key":61,"publicationTags":1006,"standard":20},[],{"EN":58,"VI":58},{"EN":58,"VI":60},[63],[67,68],{"id":71,"indexDatabase":1009,"url":84,"indexYears":20,"academicFieldIds":1014,"indexDatabaseRanking":20},{"id":73,"createTime":20,"updateTime":20,"relativeEntities":1010,"label":1011,"description":1012,"key":80,"publicationTags":1013,"standard":20},[],{"EN":76,"VI":76},{"EN":78,"VI":79},[82,83],[86],{"impactFactor":21,"impactFactorByYear":1016,"i10Index":21,"i10IndexLast5Year":21,"totalPublication":90,"totalPublicationByYear":1017,"totalCitation":21,"totalCitationByYear":1018,"totalCitationPerPublication":21,"totalCitationPerPublicationByYear":1019,"hindexLast5Year":21,"hindex":21},{},{"2020":92,"2021":92},{},{},{"pages":1021,"volume":1023},{"VOID":1022},"232-242",{"VOID":580},"2022-10-10",[82,63],{"id":1027,"createTime":1028,"updateTime":1029,"relativeEntities":1030,"slug":1031,"properties":1032,"entityType":117,"verifyStatus":118,"verifyTime":1029,"verifyNote":120,"languages":20,"translateLanguages":20,"viewCount":21,"primaryUrl":1041,"fullTextUrl":20,"authors":1042,"publicationType":154,"publisherRelationship":1058,"citationCount":20,"citationInfo":20,"publishDate":1110,"publishYear":1111,"citationAnalyzeStatus":19,"lastCitationAnalyze":20,"indexDatabases":1112,"openAccess":20,"references":20,"isForceReanalyzing":215},"9188328c-150e-409c-af2f-6f314c1ef24d","2024-02-05T21:19:53.320+00:00","2025-02-16T18:54:48.971+00:00",[],"Inference-of-bounded-L-systems-with-polymorphic-P-systems",{"abstract":1033,"title":1035,"references":1037,"doi":1039},{"EN":1034},"In this paper, we are going to solve the inference problem of bounded L systems, namely such L systems which work on filaments having length up to a fixed size. We will show that these bounded L systems have considerable computational power as they can simulate linear-bounded automata. To carry out the inference, we are going to construct a specific polymorphic P system with target indication, which can reproduce the transitions of the examined bounded L system, and which is of size \n                  \n                    \n                  \n                  $$O(n|G|^4)$$\n                  \n                    \n                  \n                , where G is the alphabet of the bounded L system with n as the maximal size of the filaments.",{"EN":1036},"Inference of bounded L systems with polymorphic P systems",{"VOID":1038},"Alhazov A, Ivanov S, Rogozhin Y. Polymorphic P systems. In: Gheorge M, Hinze T, Păun G, Rosenberg G, Salomaa A, editors. Membrane computing, vol. 6501., Lecture Notes in Computer ScienceBerlin: Springer; 2011. p. 81–94.\nAlhazov A, Freund R, Ivanov S. Polymorphic P systems: a survey. IMCS Bull. 2016;2:79–102.\nBen-Naoum F. A survey on L-system inference. INFOCOMP J Comput Sci. 2009;8(3):29–39.\nBulletin of the International Membrane Computing Society (IMCS). http:\u002F\u002Fmembranecomputing.net\u002FIMCSBulletin\u002Findex.php\nFeliciangeli H, Herman GT. Algorithms for producing grammars from sample derivations: a common problem of formal language theory and developmental biology. J. Comput. Syst. Sci. 1973;7:97–118.\nHeinz J, Sempere JM, editors. Topics in grammatical inference. Berlin: Springer; 2016.\nHerman GT. Computing ability of a developmental model for filamentous organisms. J Theor Biol. 1969;25:421–35.\nHiguera C. Grammatical inference: learning automata and grammars. Cambridge: Cambridge University Press; 2010.\nKozen DC. Automata and computability. Berlin: Springer; 1997.\nKuroda SY. Classes of languages and linear-bounded automata. Inf Control. 1964;7:207–23.\nLandweber PS. Three theorems on phrase structure grammars of type 1. Inf Control. 1963;6:131–6.\nLindenmayer A. Mathematical models for cellular interaction in development. J Theor Biol. 1968;18:280–315.\nMyhill J. Linear bounded automata. WADD Tech. Note No. 60-165. Ohio: Wright–Patterson Air Force Base; 1960.\nPăun G. Computing with membranes. TUCS Report 208 (1998). J Comput Syst Sci. 2000;61(1):108–43.\nPăun G. Membrane computing. An introduction. Berlin: Springer; 2002.\nPăun G, Rozenberg G, Salomaa A, editors. The Oxford handbook of membrane computing. Oxford: Oxford University Press; 2010.\nRozenberg G, Salomaa A. L Systems. Berlin: Springer; 1974.\nRozenberg G, Salomaa A. The mathematical theory of L systems. London: Academic Press; 1980.\nRozenberg G, Salomaa A. The book of L. Berlin: Springer; 1986.\nRozenberg G, Salomaa A, editors. Lindenmayer systems: impacts on theoretical computer science, computer graphics, and developmental biology. Berlin: Springer; 1992.\nSempere JM, García P. Grammatical inference: theoretical results and applications. In: 10th International colloquium, ICGI 2010, Valencia; 2010.\nThe P systems website. http:\u002F\u002Fppage.psystems.eu\u002F",{"VOID":1040},"10.1007\u002Fs41965-019-00007-0","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs41965-019-00007-0",[1043],{"id":1044,"sortIndex":21,"researcher":20,"roles":1045,"affiliations":1046,"properties":1055,"displayName":1057,"givenName":20,"familyName":20},"24963b2e-d2d3-4af3-a3fd-51168a45f34c",[126],[1047],{"id":1048,"sortIndex":21,"affiliation":1049,"properties":20},"674bd4bd-def7-4638-a3f0-501db337ba7a",{"id":1048,"createTime":20,"updateTime":20,"relativeEntities":1050,"slug":20,"properties":1051,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":1054,"statistic":20},[],{"title":1052},{"VI":1053},"Faculty of Informatics, Eötvös Loránd University, Budapest, Hungary",[],{"title":1056},{"VI":1057},"Gábor Román",{"url":1041,"publisher":1059,"properties":1105},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":1060,"slug":10,"properties":1061,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":1065,"manageAffiliations":1074,"indexDatabases":1085,"url":87,"thumbnailPath":20,"statistic":1100,"gsStatistic":20,"type":95,"analyzePriority":20},[],{"issn":1062,"title":1063,"eissn":1064},{"VOID":13},{"EN":15},{"VOID":17},[1066,1070],{"id":24,"createTime":20,"updateTime":20,"relativeEntities":1067,"label":1068,"description":1069,"parentId":20,"standard":20,"scholarHubFieldId":20},[],{"EN":27},{},{"id":30,"createTime":20,"updateTime":20,"relativeEntities":1071,"label":1072,"description":1073,"parentId":20,"standard":20,"scholarHubFieldId":20},[],{"EN":33},{},[1075,1080],{"id":37,"createTime":20,"updateTime":20,"relativeEntities":1076,"slug":20,"properties":1077,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":1079,"statistic":20},[],{"title":1078},{"EN":41},[43],{"id":45,"createTime":20,"updateTime":20,"relativeEntities":1081,"slug":20,"properties":1082,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":1084,"statistic":20},[],{"title":1083},{"EN":49},[43],[1086,1093],{"id":53,"indexDatabase":1087,"url":64,"indexYears":65,"academicFieldIds":1092,"indexDatabaseRanking":69},{"id":55,"createTime":20,"updateTime":20,"relativeEntities":1088,"label":1089,"description":1090,"key":61,"publicationTags":1091,"standard":20},[],{"EN":58,"VI":58},{"EN":58,"VI":60},[63],[67,68],{"id":71,"indexDatabase":1094,"url":84,"indexYears":20,"academicFieldIds":1099,"indexDatabaseRanking":20},{"id":73,"createTime":20,"updateTime":20,"relativeEntities":1095,"label":1096,"description":1097,"key":80,"publicationTags":1098,"standard":20},[],{"EN":76,"VI":76},{"EN":78,"VI":79},[82,83],[86],{"impactFactor":21,"impactFactorByYear":1101,"i10Index":21,"i10IndexLast5Year":21,"totalPublication":90,"totalPublicationByYear":1102,"totalCitation":21,"totalCitationByYear":1103,"totalCitationPerPublication":21,"totalCitationPerPublicationByYear":1104,"hindexLast5Year":21,"hindex":21},{},{"2020":92,"2021":92},{},{},{"pages":1106,"volume":1108},{"VOID":1107},"52-57",{"VOID":1109},"1","2019-01-22",2019,[82,63],{"id":1114,"createTime":1115,"updateTime":1116,"relativeEntities":1117,"slug":1118,"properties":1119,"entityType":117,"verifyStatus":118,"verifyTime":1116,"verifyNote":120,"languages":20,"translateLanguages":20,"viewCount":21,"primaryUrl":1128,"fullTextUrl":20,"authors":1129,"publicationType":154,"publisherRelationship":1145,"citationCount":20,"citationInfo":20,"publishDate":1196,"publishYear":209,"citationAnalyzeStatus":19,"lastCitationAnalyze":20,"indexDatabases":1197,"openAccess":20,"references":20,"isForceReanalyzing":215},"61142f18-dc19-4b35-aed8-2597b4f9fabc","2024-01-03T04:17:47.478+00:00","2025-02-16T04:32:52.076+00:00",[],"Bounding-the-space-in-P-systems-with-active-membranes",{"abstract":1120,"title":1122,"references":1124,"doi":1126},{"EN":1121},"P systems with active membranes have been widely used to attack problems in $${\\mathbf{NP}}$$ or even in $${{\\mathbf{PSPACE }}}$$; in general, an exponential amount of space is generated in polynomial time by dividing existing membranes. Natural questions arise in this framework, concerning the power of P systems when different bounds are considered for the use of the space resource. We consider in this paper two natural bounds: the amount of available physical space (in terms of the number of objects and membranes) and the organization of the membrane structure (in particular, concerning the depth of the membrane structure). We present the main results obtained so far on this subject.",{"EN":1123},"Bounding the space in P systems with active membranes",{"VOID":1125},"Alhazov, A., Martin-Vide, C., & Pan, L. (2003). Solving a PSPACE-complete problem by recognizing P systems with restricted active membranes. Fundamenta Informaticae, 58(2), 67–77.\nAlhazov, A., Leporati, A., Mauri, G., Porreca, A. E., & Zandron, C. (2014). Space complexity equivalence of P systems with active membranes and Turing machines. Theoretical Computer Science, 529, 69–81.\nAlhazov, A., Pan, L., & Păun, Gh. (2004). Trading polarizations for labels in P systems with active membranes. Acta Informatica, 41, 111–144.\nGazdag, Z., & Kolonits, G. (2019). A new method to simulate restricted variants of polarizationless P systems with active membranes. Journal of Membrane Computing, 1(4), 251–261. https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs41965-019-00024-z.\nGutiérrez-Naranjo, M. A., Pérez-Jiménez, M. J., Riscos-Núñez, A., & Romero-Campero, F. J. (2006). On the power of dissolution in P systems with active membranes, In: Freund, R., Păun, G., Rozenberg, Salomaa, A., (eds), 6th International Workshop on Membrane Computing, WMC 2005, LNCS 3850, Springer, 224–240.\nGutiérrez-Naranjo, M. A., Pérez-Jiménez, M. J., & Romero-Campero, F. J. (2006). A Linear Solution for QSAT with Membrane Creation. In R. Freund, Gh Păun, G. Rozenberg, & A. Salomaa (Eds.), 6th International Workshop on Membrane Computing (pp. 241–252). WMC 2005, LNCS 3850, Springer, New York.\nIshdorj, T. O., Replicative, Ionescu M., Rules, Distribution, & in P Systems with Active Membranes, ICTAC. (2004). LNCS 3407. Springer, New York, 2004, 68–83.\nLeporati, A., Ferretti, C., Mauri, G., Pérez-Jiménez, M. J., & Zandron, C. (2008). Complexity aspects of polarizationless membrane systems. Natural Computing, 8(4), 703–717.\nLeporati, A., Mauri, G., Porreca, A. E., & Zandron, C. (2011). Elementary active membranes have the power of counting. International Journal of Natural Computing Research, 2(3), 35–48.\nLeporati, A., Manzoni, L., Mauri, G., Porreca, A. E., & Zandron, C. (2014). A gap in the space hierarchy of P systems with active membranes. Journal of Automata, Languages and Combinatorics, 19(1–4), 173–184.\nLeporati, A., Manzoni, L., Mauri, G., Porreca, A. E., & Zandron, C. (2014). Constant-space P systems with active membranes. Fundamenta Informaticae, 134, 111–128.\nLeporati, A., Manzoni, L., Mauri, G., Porreca, A. E., & Zandron, C. (2014). Simulating Elementary Active Membrane. In M. Gheorghe, G. Rozenberg, A. Salomaa, P. Sosík, & C. Zandron (Eds.), 15th International Conference on Membrane Computing (pp. 284–299). CMC 2014, LNCS 8961, Springer, New York.\nLeporati, A., Manzoni, L., Mauri, G., Porreca, A. E., & Zandron, C. (2015). Membrane division, oracles, and the counting hierarchy. Fundamenta Informaticae, 138, 97–111.\nLeporati, A., Manzoni, L., Mauri, G., Porreca, A. E., & Zandron, C. (2016). Monodirectional P systems. Natural Computing, 15, 551–564.\nLeporati, A., Manzoni, L., Mauri, G., Porreca, A. E., & Zandron, C. (2017). A toolbox for simpler active membrane algorithms. Theoretical Computer Science, 673, 42–57.\nLeporati, A., Manzoni, L., Mauri, G., Porreca, A. E., & Zandron, C. (2017). Characterising the complexity of tissue P systems with fission rules. Journal of Computer and System Sciences, 90, 115–128.\nLeporati, A., Manzoni, L., Mauri, G., Porreca, A. E., & Zandron, C. (2016). Shallow non-confluent P systems. In A. Leporati, G. Rozenberg, A. Salomaa, & C. Zandron (Eds.), 17th International Conference on Membrane Computing (pp. 307–316). CMC 2016, LNCS 10105, Springer, New York.\nLeporati, A., Manzoni, L., Mauri, G., Porreca, A. E., & Zandron, C. (2018). Solving QSAT in sublinear depth. In T. Hinze, G. Rozenberg, A. Salomaa, & C. Zandron (Eds.), 19th International Conference on Membrane Computing (pp. 188–201). CMC 2018, LNCS 11399, Springer, New York.\nLeporati, A., Manzoni, L., Mauri, G., Porreca, A. E., & Zandron, C. (2019). Characterizing PSPACE with shallow non-confluent P systems. Journal of Membrane Computing, 1(2), 75–84. https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs41965-019-00011-4.\nLeporati, A., Manzoni, L., Mauri, G., Porreca, A. E., & Zandron, C. (2020). Shallow laconic P systems can count. Journal of Membrane Computing, 1(1), 49–58. https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs41965-020-00032-4.\nLeporati, A., Manzoni, L., Mauri, G., Porreca, A. E., & Zandron, C. (2020). A Turing machine simulation by P systems without charges. Journal of Membrane Computing,. https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs41965-020-00031-5.\nMauri, G., Pérez-Jiménez, M. J., Zandron, C., & On a Păun’s conjecture in membrane systems, IWINAC,. (2007). LNCS 4527. Springer, New York, 2007, 180–192.\nMix Barrington, D. A., Immerman, N., & Straubing, H. (1990). On uniformity within \\(\\rm NC^1\\). Journal of Computer and System Sciences, 41(3), 274–306.\nMurphy, N., Woods, D., & Active membrane systems without charges and using only symmetric elementary division characterise P, 8th Workshop on Membrane Computing, WMC, (2007). LNCS 4860. Springer, New York, 2007, 367–384.\nMurphy, N., & Woods, D. (2011). The computational power of membrane systems under tight uniformity conditions. Natural Computing, 10(1), 613–632.\nOrellana-Martín, D., Valencia-Cabrera, L., Riscos-Núñez, A., & Pérez-Jiménez, M. J. (2019). Minimal cooperation as a way to achieve the efficiency in cell-like membrane systems. Journal of Membrane Computing, 1(2), 85–92. https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs41965-018-00004-9.\nPapadimitriou, C. H. (1993). Computational Complexity. Boston: Addison-Wesley.\nPăun, Gh. (2001). P systems with active membranes: Attacking NP-complete problems. Journal of Automata, Languages and Combinatorics, 6(1), 75–90.\nPăun, Gh, Rozenberg, G., & Salomaa, A. (Eds.). (2010). Handbook of Membrane Computing. Oxford: Oxford University Press.\nPérez-Jiménez, M. J. (2009). A Computational Complexity Theory in Membrane Computing. In Gh Păun, M. J. Pérez-Jiménez, A. Riscos-Núñez, G. Rozenberg, & A. Salomaa (Eds.), Tenth International Workshop on Membrane Computing (pp. 125–148). WMC 2009, LNCS 5957, Springer, New York.\nPérez-Jiménez, M. J., & Riscos-Núñez, A. (2005). Solving the subset-sum problem by P systems with active membranes. New Generation Computing, 23, 339–356.\nPérez-Jiménez, M. J., Riscos-Núñez, A., Romero-Jiménez, A., & Woods, D. (2010). Complexity - Membrane division, membrane creation. In Gh Păun, G. Rozenberg, & A. Salomaa (Eds.), Handbook of Membrane Computing (Vol. 12, pp. 302–336). Oxford: Oxford University Press.\nPorreca, A. E., Leporati, A., Mauri, G., & Zandron, C. (2009). Introducing a space complexity measure for P systems. International Journal of Computing, Communication and Control, 4(3), 301–310.\nPorreca, A. E., Leporati, A., Mauri, G., & Zandron, C. (2011). P systems with elementary active membranes: Beyond NP and coNP. In M. Gheorghe, T. Hinze, Gh Păun, G. Rozenberg, & A. Salomaa (Eds.), 11th International Conference on Membrane Computing (pp. 338–347). CMC 2010, Springer, New York.\nPorreca, A. E., Leporati, A., Mauri, G., & Zandron, C. (2011). P systems with active membranes: Trading time for space. Natural Computing, 10(1), 167–182.\nPorreca, A. E., Leporati, A., Mauri, G., & Zandron, C. (2011). P systems with active membranes working in polynomial space. International Journal of Foundation of Computer Science, 22(1), 65–73.\nPorreca, A. E., Leporati, A., Mauri, G., & Zandron, C. (2012). P Systems Simulating Oracle Computations. In M. Gheorghe, G. Păun, A. Salomaa, G. Rozenberg, & S. Verlan (Eds.), 12th International Conference on Membrane Computing (pp. 346–358). CMC 2011, LNCS 7184, Springer, New York.\nPorreca, A. E., Leporati, A., Mauri, G., & Zandron, C. (2013). Sublinear Space P systems with Active Membranes. In E. Csuhaj-Varjú, M. Gheorghe, G. Rozenberg, A. Salomaa, & G. Vaszil (Eds.), 13th International Conference on Membrane Computing (pp. 342–357). CMC 2012, LNCS 7762, Springer, New York.\nPorreca, A. E., Mauri, G., & Zandron, C. (2006). Complexity classes for membrane systems. RAIRO-Theorerical Informatics and Applications, 40(2), 141–162.\nPorreca, A. E., Mauri, G., & Zandron, C. (2010). Non-confluence in divisionless P systems with active membranes. Theoretical Computer Science, 411, 878–887.\nSosík, P. (2003). The computational power of cell division in P systems: Beating down parallel computers? Natural Computing, 2(3), 287–298.\nSosík, P. (2019). P systems attacking hard problems beyond NP: A survey. Journal of Membrane Computing, 1(3), 198–208. https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs41965-019-00017-y.\nSosík, P., & Rodríguez-Patón, A. (2007). Membrane computing and complexity theory: A characterization of PSPACE. Journal of Computer and System Sciences, 73(1), 37–152.\nSosík, P., Păun, A., Rodríguez-Patón, A., & Pérez, D. (2010). On the Power of Computing with Proteins on Membranes. In Gh Păun, M. J. Pérez-Jiménez, A. Riscos-Núñez, G. Rozenberg, & A. Salomaa (Eds.), 10th international Workshop on Membrane Computing (pp. 448–460). WMC 2009, LNCS 5957, Springer, New York.\nValencia-Cabrera, L., Orellana-Martín, D., Martínez-del-Amor, M. A., Riscos-Núñez, A., & Pérez-Jiménez, M. J. (2017). Reaching efficiency through collaboration in membrane systems: Dissolution, polarization and cooperation. Theoretical Computer Science, 701, 226–234.\nValencia-Cabrera, L., Orellana-Martín, D., Martínez-del-Amor, M. A., Riscos-Núñez, A., & Pérez-Jiménez, M. J. (2017). Computational efficiency of minimal cooperation and distribution in polarizationless P systems with active membranes. Fundamenta Informaticae, 153(1–2), 147–172.\nZandron, C., Ferretti, C., & Mauri, G. (2000). Solving NP-complete problems using P systems with active membranes. In I. Antoniou, C. S. Calude, & M. J. Dinneen (Eds.), Unconventional Models of Computation, UMC2K (pp. 289–301). Discrete Mathematics and Theoretical Computer Science: Springer, New York.",{"VOID":1127},"10.1007\u002Fs41965-020-00039-x","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs41965-020-00039-x",[1130],{"id":1131,"sortIndex":21,"researcher":20,"roles":1132,"affiliations":1133,"properties":1142,"displayName":1144,"givenName":20,"familyName":20},"d8669daf-6cc8-409e-a2c5-ffa603068948",[126],[1134],{"id":1135,"sortIndex":21,"affiliation":1136,"properties":20},"94253172-98e4-4edc-8e2f-423462240cb9",{"id":1135,"createTime":20,"updateTime":20,"relativeEntities":1137,"slug":20,"properties":1138,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":1141,"statistic":20},[],{"title":1139},{"EN":1140},"Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Milan, Italy",[],{"title":1143},{"VI":1144},"Claudio Zandron",{"url":1128,"publisher":1146,"properties":1192},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":1147,"slug":10,"properties":1148,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":1152,"manageAffiliations":1161,"indexDatabases":1172,"url":87,"thumbnailPath":20,"statistic":1187,"gsStatistic":20,"type":95,"analyzePriority":20},[],{"issn":1149,"title":1150,"eissn":1151},{"VOID":13},{"EN":15},{"VOID":17},[1153,1157],{"id":24,"createTime":20,"updateTime":20,"relativeEntities":1154,"label":1155,"description":1156,"parentId":20,"standard":20,"scholarHubFieldId":20},[],{"EN":27},{},{"id":30,"createTime":20,"updateTime":20,"relativeEntities":1158,"label":1159,"description":1160,"parentId":20,"standard":20,"scholarHubFieldId":20},[],{"EN":33},{},[1162,1167],{"id":37,"createTime":20,"updateTime":20,"relativeEntities":1163,"slug":20,"properties":1164,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":1166,"statistic":20},[],{"title":1165},{"EN":41},[43],{"id":45,"createTime":20,"updateTime":20,"relativeEntities":1168,"slug":20,"properties":1169,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":1171,"statistic":20},[],{"title":1170},{"EN":49},[43],[1173,1180],{"id":53,"indexDatabase":1174,"url":64,"indexYears":65,"academicFieldIds":1179,"indexDatabaseRanking":69},{"id":55,"createTime":20,"updateTime":20,"relativeEntities":1175,"label":1176,"description":1177,"key":61,"publicationTags":1178,"standard":20},[],{"EN":58,"VI":58},{"EN":58,"VI":60},[63],[67,68],{"id":71,"indexDatabase":1181,"url":84,"indexYears":20,"academicFieldIds":1186,"indexDatabaseRanking":20},{"id":73,"createTime":20,"updateTime":20,"relativeEntities":1182,"label":1183,"description":1184,"key":80,"publicationTags":1185,"standard":20},[],{"EN":76,"VI":76},{"EN":78,"VI":79},[82,83],[86],{"impactFactor":21,"impactFactorByYear":1188,"i10Index":21,"i10IndexLast5Year":21,"totalPublication":90,"totalPublicationByYear":1189,"totalCitation":21,"totalCitationByYear":1190,"totalCitationPerPublication":21,"totalCitationPerPublicationByYear":1191,"hindexLast5Year":21,"hindex":21},{},{"2020":92,"2021":92},{},{},{"pages":1193,"volume":1195},{"VOID":1194},"137-145",{"VOID":206},"2020-04-22",[82,63],{"id":1199,"createTime":1200,"updateTime":1201,"relativeEntities":1202,"slug":1203,"properties":1204,"entityType":117,"verifyStatus":118,"verifyTime":1201,"verifyNote":120,"languages":20,"translateLanguages":20,"viewCount":21,"primaryUrl":1213,"fullTextUrl":20,"authors":1214,"publicationType":154,"publisherRelationship":1271,"citationCount":20,"citationInfo":20,"publishDate":1322,"publishYear":1111,"citationAnalyzeStatus":19,"lastCitationAnalyze":20,"indexDatabases":1323,"openAccess":20,"references":20,"isForceReanalyzing":215},"c904a459-abec-4124-ae2a-feed58148273","2023-12-25T16:58:21.729+00:00","2025-02-15T02:49:54.748+00:00",[],"Search-based-testing-in-membrane-computing",{"abstract":1205,"title":1207,"references":1209,"doi":1211},{"EN":1206},"Search-based testing is widely used for generating test sets. It is also applied in the case of model-based testing, especially for (extended) finite state machines. In this paper, we define such an approach for kernel P system models. We consider a specific kernel P system model and a define a search-based testing method. The test set generated consists of input sequences producing a given computation defined by the model. An example illustrates the use of the introduced method.",{"EN":1208},"Search-based testing in membrane computing",{"VOID":1210},"The P systems website. http:\u002F\u002Fppage.psystems.eu. Accessed 12 May 2018.\nPăun, Gh. (1998). Computing with membranes. Tech. rep., Turku Centre for Computer Science.\nPăun, Gh. (2000). Computing with membranes. Journal of Computer and System Sciences, 61(1), 108–143. https:\u002F\u002Fdoi.org\u002F10.1006\u002Fjcss.1999.1693.\nGheorghe, M., Ipate, F., Dragomir, C., Mierlă, L., Valencia-Cabrera, L., García-Quismondo, M., & Pérez-Jiménez, M.J. (2013). Kernel P Systems - Version I. Eleventh Brainstorming Week on Membrane Computing (11BWMC), pp. 97–124.\nGheorghe, M., Ceterchi, R., Ipate, F., Konur, S., & Lefticaru, R. (2018). Kernel P systems: from modelling to verification and testing. Theoretical Computer Science 724, 45–60. http:\u002F\u002Fhdl.handle.net\u002F10454\u002F11720.\nBlakes, J., Twycross, J., Konur, S., Romero-Campero, F.J., Krasnogor, N., & Gheorghe, M. (2014). Infobiotics workbench: A P systems based tool for systems and synthetic biology. In Applications of membrane computing in systems and synthetic biology, emergence, complexity and computation, vol. 7, pp. 1–41. Springer International Publishing.\nSanassy, D., Fellermann, H., Krasnogor, N., Konur, S., Mierlă, L., Gheorghe, M., Ladroue, C., & Kalvala, S. (2014). Modelling and stochastic simulation of synthetic biological boolean gates. In 2014 IEEE International Conference on High Performance Computing and Communications, HPCC 2014, Paris, France, pp. 404–408.\nKonur, S., Gheorghe, M., Dragomir, C., Mierlă, L., Ipate, F., & Krasnogor, N. (2015). Qualitative and quantitative analysis of systems and synthetic biology constructs using P systems. ACS Synthetic Biology, 4(1), 83–92.\nKonur, S., Gheorghe, M., Dragomir, C., Ipate, F., & Krasnogor, N. (2014). Conventional verification for unconventional computing: a genetic XOR gate example. Fundamenta Informaticae, 134(1–2), 97–110.\nKonur, S., Kiran, M., Gheorghe, M., Burkitt, M., & Ipate, F. (2015). Agent-based high-performance simulation of biological systems on the GPU. In 17th IEEE International Conference on High Performance Computing and Communications, HPCC 2015, pp. 84–89.\nGheorghe, M., Konur, S., & Ipate, F. (2017). Kernel P systems and stochastic P systems for modelling and formal verification of genetic logic gates, pp. 661–675. Springer International Publishing, Cham.\nLefticaru, R., Konur, S., Yildirim, U., Uddin, A., Campean, F., & Gheorghe, M. (2017). Towards an integrated approach to verification and model-based testing in system engineering. In The International Workshop on Engineering Data- & Model-driven Applications (EDMA-2017) within the IEEE International Conference on Cyber, Physical and Social Computing (CPSCom), pp. 131–138. http:\u002F\u002Fhdl.handle.net\u002F10454\u002F12322\nDragomir, C., Ipate, F., Konur, S., Lefticaru, R., & Mierlă, L. (2014). Model checking kernel P systems. In A. Alhazov, S. Cojocaru, M. Gheorghe, Y. Rogozhin, G. Rozenberg, & A. Salomaa (Eds.), Membrane computing (Vol. 8340, pp. 151–172), Lecture Notes in Computer Science Berlin Heidelberg: Springer.\nCoakley, S., Gheorghe, M., Holcombe, M., Chin, S., Worth, D., & Greenough, C. (2012). Exploitation of high performance computing in the FLAME agent-based simulation framework. In 14th IEEE International Conference on High Performance Computing and Communication, HPCC 2012, pp. 538–545.\nKiran, M., Konur, S., Gheorghe, M., Burkitt, M., & Ipate, F. (2015). Agent-based high-performance simulation of biological systems on the GPU. In 2015 IEEE 17th International Conference on High Performance Computing and Communications. pp. 84–89.\nIpate, F., & Gheorghe, M. (2009). Finite state based testing of P systems. Natural Computing, 8(4), 833–846. https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs11047-008-9099-3.\nIpate, F., & Gheorghe, M. (2009). Testing non-deterministic stream X-machine models and P systems. Electronic Notes in Theoretical Computer Science, 227, 113–126. https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.entcs.2008.12.107.\nLefticaru, R., Gheorghe, M., & Ipate, F. (2011). An empirical evaluation of P system testing techniques. Natural Computing, 10(1), 151–165. https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs11047-010-9188-y.\nIpate, F., Gheorghe, M., & Lefticaru, R. (2010). Test generation from P systems using model checking. Journal of Logic and Algebraic Programming, 79(6), 350–362. https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.jlap.2010.03.007.\nGheorghe, M., Ipate, F., & Konur, S. (2016). Testing based on identifiable P systems using cover automata and X-machines. Information Sciences 372, 565–578. https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.ins.2016.08.028.\nGheorghe, M., Ipate, F., Lefticaru, R., & Ţurlea, A. (2018). Testing identifiable kernel P systems using an X-machine approach. In International Conference on Membrane Computing, pp. 142–159, Springer.\nHarman, M., & McMinn, P. (2010). A theoretical and empirical study of search-based testing: Local, global, and hybrid search. IEEE Transactions on Software Engineering, 36(2), 226–247.\nKalaji, A. S., Hierons, R. M., & Swift, S. (2011). An integrated search-based approach for automatic testing from extended finite state machine (EFSM) models. Information & Software Technology, 53(12), 1297–1318.\nLefticaru, R., & Ipate, F. (2008). Functional Search-based Testing from State Machines. In First International Conference on Software Testing, Verification, and Validation, ICST 2008, Lillehammer, Norway, pp. 525–528.\nLefticaru, R., & Ipate, F. (2007). Automatic state-based test generation using genetic algorithms. In Proc. SYNASC’07, pp. 188–195. IEEE Computer Society.\nŢurlea, A., Ipate, F., & Lefticaru, R. (2016). A hybrid test generation approach based on extended finite state machines. In 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2016, Timişoara, Romania, pp. 173–180. https:\u002F\u002Fdoi.org\u002F10.1109\u002FSYNASC.2016.037.\nMitchell, M. (1998). An Introduction to Genetic Algorithms. Cambridge: MIT Press.\nNicolescu, R., Dinneen, M.J., & Kim, Y.B. (2009). Structure modelling with hyperdag p systems: Part B. Tech. rep., Centre for Discrete Mathematics and Theoretical Computer Science, CDMTCS-373.\nHenderson, A., & Nicolescu, R. (2019). Actor-like cP systems. In T. Hinze, G. Rozenberg, A. Salomaa, & C. Zandron (Eds.), Membrane Computing (Vol. 11399, pp. 160–187), Lecture Notes in Computer Science Berlin Heidelberg: Springer.\nBakir, M.E., Ipate, F., Konur, S., Mierlă, L., & Niculescu, I. (2014). Extended simulation and verification platform for kernel P systems. In Membrane Computing—15th International Conference, CMC 2014, pp. 158–178.\nHolcombe, M. (1988). X-machines as a basis for dynamic system specification. Software Engineering Journal, 3(2), 69–76.\nBakir, M.E., Konur, S., Gheorghe, M., Niculescu, I., & Ipate, F. (2014). High performance simulations of kernel P systems. In 2014 IEEE international conference on high performance computing and communications, HPCC 2014, pp. 409–412.\nGheorghe, M., Konur, S., Ipate, F., Mierlă, L., Bakir, M.E., & Stannett, M. (2015). An integrated model checking toolset for kernel P systems. In Membrane Computing - 16th International Conference, CMC 2015, pp. 153–170\nArapinis, M., Calder, M., Denis, L., Fisher, M., Gray, P., Konur, S., et al. (2009). Towards the verification of pervasive systems. Electronic Communications of the EASST, 2009, 22.\nKonur, S., Fisher, M., Dobson, S., & Knox, S. (2014). Formal verification of a pervasive messaging system. Formal Aspects of Computing, 26(4), 677–694.\nKonur, S., & Gheorghe, M. (2015). A property-driven methodology for formal analysis of synthetic biology systems. IEEE\u002FACM Transactions on Computational Biology and Bioinformatics., 12, 360–371.\nBakir, M. E., Konur, S., Gheorghe, M., Krasnogor, N., & Stannett, M. (2018). Automatic selection of verification tools for efficient analysis of biochemical models. Bioinformatics, 34(18), 3187–3195.\nKonur, S. (2010). Real-time and probabilistic temporal logics: An overview. CoRR arXiv:1005.3200.\nKonur, S. (2013). A survey on temporal logics for specifying and verifying real-time systems. Frontiers of Computer Science, 7(3), 370–403.\nKonur, S. (2014). Specifying safety-critical systems with a decidable duration logic. Science of Computer Programming, 80, 264–287.\nHolzmann, G. J. (1997). The model checker SPIN. IEEE Transactions on Software Engineering, 23(5), 275–295.\nCimatti, A., Clarke, E.M., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R., & Tacchella, A. (2002). NuSMV 2: An open source tool for symbolic model checking. In Computer Aided Verification, 14th International Conference, CAV 2002, Proceedings, pp. 359–364.\nHarman, M., & McMinn, P.: A theoretical & empirical analysis of evolutionary testing and hill climbing for structural test data generation. In Proceedings of the 2007 international symposium on Software testing and analysis. pp. 73–83. ACM (2007).",{"VOID":1212},"10.1007\u002Fs41965-019-00027-w","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs41965-019-00027-w",[1215,1230,1245,1258],{"id":1216,"sortIndex":21,"researcher":20,"roles":1217,"affiliations":1218,"properties":1227,"displayName":1229,"givenName":20,"familyName":20},"6c11c54d-7ba8-4d4c-bdb6-3ebb7a8d7b4a",[126],[1219],{"id":1220,"sortIndex":21,"affiliation":1221,"properties":20},"135164ee-7610-4714-9913-3a1f2c5c0ae2",{"id":1220,"createTime":20,"updateTime":20,"relativeEntities":1222,"slug":20,"properties":1223,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":1226,"statistic":20},[],{"title":1224},{"VI":1225},"Faculty of Mathematics and Computer Science and ICUB, University of Bucharest, Bucharest, Romania",[],{"title":1228},{"VI":1229},"Ana Ţurlea",{"id":1231,"sortIndex":92,"researcher":20,"roles":1232,"affiliations":1233,"properties":1242,"displayName":1244,"givenName":20,"familyName":20},"edee126c-2bad-4163-b1ec-0568a9f1b0a9",[126],[1234],{"id":1235,"sortIndex":21,"affiliation":1236,"properties":20},"25a45d08-fa4f-44fb-8e41-2f22844da593",{"id":1235,"createTime":20,"updateTime":20,"relativeEntities":1237,"slug":20,"properties":1238,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":1241,"statistic":20},[],{"title":1239},{"EN":1240},"Department of Computer Science, University of Bradford, Bradford, UK",[],{"title":1243},{"VI":1244},"Marian Gheorghe",{"id":1246,"sortIndex":90,"researcher":20,"roles":1247,"affiliations":1248,"properties":1255,"displayName":1257,"givenName":20,"familyName":20},"1b6046a4-abc1-4d24-b220-81d5897d0abc",[126],[1249],{"id":1220,"sortIndex":21,"affiliation":1250,"properties":20},{"id":1220,"createTime":20,"updateTime":20,"relativeEntities":1251,"slug":20,"properties":1252,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":1254,"statistic":20},[],{"title":1253},{"VI":1225},[],{"title":1256},{"VI":1257},"Florentin Ipate",{"id":1259,"sortIndex":211,"researcher":20,"roles":1260,"affiliations":1261,"properties":1268,"displayName":1270,"givenName":20,"familyName":20},"8d142137-771c-4193-b46d-2074e4de6d1f",[126],[1262],{"id":1235,"sortIndex":21,"affiliation":1263,"properties":20},{"id":1235,"createTime":20,"updateTime":20,"relativeEntities":1264,"slug":20,"properties":1265,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":1267,"statistic":20},[],{"title":1266},{"EN":1240},[],{"title":1269},{"VI":1270},"Savas Konur",{"url":1213,"publisher":1272,"properties":1318},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":1273,"slug":10,"properties":1274,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":1278,"manageAffiliations":1287,"indexDatabases":1298,"url":87,"thumbnailPath":20,"statistic":1313,"gsStatistic":20,"type":95,"analyzePriority":20},[],{"issn":1275,"title":1276,"eissn":1277},{"VOID":13},{"EN":15},{"VOID":17},[1279,1283],{"id":24,"createTime":20,"updateTime":20,"relativeEntities":1280,"label":1281,"description":1282,"parentId":20,"standard":20,"scholarHubFieldId":20},[],{"EN":27},{},{"id":30,"createTime":20,"updateTime":20,"relativeEntities":1284,"label":1285,"description":1286,"parentId":20,"standard":20,"scholarHubFieldId":20},[],{"EN":33},{},[1288,1293],{"id":37,"createTime":20,"updateTime":20,"relativeEntities":1289,"slug":20,"properties":1290,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":1292,"statistic":20},[],{"title":1291},{"EN":41},[43],{"id":45,"createTime":20,"updateTime":20,"relativeEntities":1294,"slug":20,"properties":1295,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":1297,"statistic":20},[],{"title":1296},{"EN":49},[43],[1299,1306],{"id":53,"indexDatabase":1300,"url":64,"indexYears":65,"academicFieldIds":1305,"indexDatabaseRanking":69},{"id":55,"createTime":20,"updateTime":20,"relativeEntities":1301,"label":1302,"description":1303,"key":61,"publicationTags":1304,"standard":20},[],{"EN":58,"VI":58},{"EN":58,"VI":60},[63],[67,68],{"id":71,"indexDatabase":1307,"url":84,"indexYears":20,"academicFieldIds":1312,"indexDatabaseRanking":20},{"id":73,"createTime":20,"updateTime":20,"relativeEntities":1308,"label":1309,"description":1310,"key":80,"publicationTags":1311,"standard":20},[],{"EN":76,"VI":76},{"EN":78,"VI":79},[82,83],[86],{"impactFactor":21,"impactFactorByYear":1314,"i10Index":21,"i10IndexLast5Year":21,"totalPublication":90,"totalPublicationByYear":1315,"totalCitation":21,"totalCitationByYear":1316,"totalCitationPerPublication":21,"totalCitationPerPublicationByYear":1317,"hindexLast5Year":21,"hindex":21},{},{"2020":92,"2021":92},{},{},{"pages":1319,"volume":1321},{"VOID":1320},"241-250",{"VOID":1109},"2019-12-02",[82,63]]