{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T16:51:36Z","timestamp":1766076696366,"version":"3.48.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T00:00:00Z","timestamp":1743638400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T00:00:00Z","timestamp":1743638400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100009934","name":"E\u00f6tv\u00f6s Lor\u00e1nd University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100009934","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Membr Comput"],"published-print":{"date-parts":[[2025,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>In this paper, we introduce a new method of filtering strings before communication in networks of evolutionary processors which is based on whether the length of strings at the given node increases, decreases, or remains unchanged after an evolutionary step is performed. This filtering mechanism differs from the usual ones, where context conditions are considered, as it is based only on quantitative conditions (the lengths of the strings) and does not take into account qualitative properties of the string to be communicated. We prove that any recursively enumerable language can be obtained as the language of a variant of hybrid networks of evolutionary processors with this new communication mode. We also show how two well-known NP-complete problems can be solved by the new model in linear time.<\/jats:p>","DOI":"10.1007\/s41965-025-00184-1","type":"journal-article","created":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T00:53:12Z","timestamp":1743814392000},"page":"377-390","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Length-driven communication in networks of evolutionary processors"],"prefix":"10.1007","volume":"7","author":[{"given":"Erzs\u00e9bet","family":"Csuhaj-Varj\u00fa","sequence":"first","affiliation":[]},{"given":"Pramod Kumar","family":"Sethy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,3]]},"reference":[{"issue":"6\u20137","key":"184_CR1","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/S00236-003-0114-Y","volume":"39","author":"J Castellanos","year":"2003","unstructured":"Castellanos, J., Mart\u00edn-Vide, C., Mitrana, V., & Sempere, J. M. (2003). Networks of evolutionary processors. Acta Informatica, 39(6\u20137), 517\u2013529. https:\/\/doi.org\/10.1007\/S00236-003-0114-Y","journal-title":"Acta Informatica"},{"key":"184_CR2","doi-asserted-by":"publisher","unstructured":"Mart\u00edn-Vide, C., Mitrana, V., P\u00e9rez-Jim\u00e9nez, M. J., & Sancho-Caparrini, F. (2003) Hybrid networks of evolutionary processors. In: Cant\u00fa-Paz, E., Foster, J. A., Deb, K., Davis, L., Roy, R., O\u2019Reilly, U., Beyer, H., Standish, R.K., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A. C., Dowsland, K. A., Jonoska, N., & Miller, J. F. (Eds.), Genetic and Evolutionary Computation - GECCO 2003, Genetic and Evolutionary Computation Conference, Chicago, IL, USA, July 12\u201316, 2003. Proceedings, Part I. Lecture Notes in Computer Science (Vol. 2723, pp. 401\u2013412). Berlin, Heidelberg: Springer. https:\/\/doi.org\/10.1007\/3-540-45105-6_49","DOI":"10.1007\/3-540-45105-6_49"},{"issue":"35","key":"184_CR3","doi-asserted-by":"publisher","first-page":"3188","DOI":"10.1016\/J.TCS.2009.05.003","volume":"410","author":"A Alhazov","year":"2009","unstructured":"Alhazov, A., Csuhaj-Varj\u00fa, E., Mart\u00edn-Vide, C., & Rogozhin, Y. (2009). On the size of computationally complete hybrid networks of evolutionary processors. Theoretical Computer Science, 410(35), 3188\u20133197. https:\/\/doi.org\/10.1016\/J.TCS.2009.05.003","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"184_CR4","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/J.TCS.2004.07.035","volume":"330","author":"J Castellanos","year":"2005","unstructured":"Castellanos, J., Leupold, P., & Mitrana, V. (2005). On the size complexity of hybrid networks of evolutionary processors. Theoretical Computer Science, 330(2), 205\u2013220. https:\/\/doi.org\/10.1016\/J.TCS.2004.07.035","journal-title":"Theoretical Computer Science"},{"key":"184_CR5","doi-asserted-by":"publisher","unstructured":"Alhazov, A., Csuhaj-Varj\u00fa, E., Mart\u00edn-Vide, C., & Rogozhin, Y. (2008). About universal hybrid networks of evolutionary processors of small size. In: Mart\u00edn-Vide, C., Otto, F., & Fernau, H. (Eds.), Language and automata theory and applications, second international conference, LATA 2008, Tarragona, Spain, March 13\u201319, 2008. Revised Papers. Lecture Notes in Computer Science (Vol. 5196, pp. 28\u201339). Berlin, Heidelberg: Springer. https:\/\/doi.org\/10.1007\/978-3-540-88282-4_5","DOI":"10.1007\/978-3-540-88282-4_5"},{"issue":"4\u20135","key":"184_CR6","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/S00236-004-0158-7","volume":"41","author":"E Csuhaj-Varj\u00fa","year":"2005","unstructured":"Csuhaj-Varj\u00fa, E., Mart\u00edn-Vide, C., & Mitrana, V. (2005). Hybrid networks of evolutionary processors are computationally complete. Acta Informatica, 41(4\u20135), 257\u2013272. https:\/\/doi.org\/10.1007\/S00236-004-0158-7","journal-title":"Acta Informatica"},{"key":"184_CR7","doi-asserted-by":"publisher","unstructured":"Margenstern, M., Mitrana, V., & P\u00e9rez-Jim\u00e9nez, M. J. (2004). Accepting hybrid networks of evolutionary processors. In: Ferretti, C., Mauri, G., & Zandron, C. (Eds.), DNA computing, 10th international workshop on DNA computing, DNA 10, Milan, Italy, June 7\u201310, 2004, Revised selected papers. Lecture notes in computer science (Vol. 3384, pp. 235\u2013246). Berlin, Heidelberg: Springer. https:\/\/doi.org\/10.1007\/11493785_21","DOI":"10.1007\/11493785_21"},{"key":"184_CR8","doi-asserted-by":"publisher","unstructured":"Bottoni, P., Labella, A., Manea, F., Mitrana, V., & Sempere, J. M. (2009). Filter position in networks of evolutionary processors does not matter: A direct proof. In: Deaton, R. J., & Suyama, A. (Eds.), DNA computing and molecular programming, 15th international conference, DNA 15, Fayetteville, AR, USA, June 8\u201311, 2009, Revised selected papers. Lecture notes in computer science (Vol. 5877, pp. 1\u201311). Berlin, Heidelberg: Springer. https:\/\/doi.org\/10.1007\/978-3-642-10604-0_1","DOI":"10.1007\/978-3-642-10604-0_1"},{"issue":"1","key":"184_CR9","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1142\/S0129054111007915","volume":"22","author":"F Arroyo","year":"2011","unstructured":"Arroyo, F., Castellanos, J., Mitrana, V., Santos, E., & Sempere, J. M. (2011). Filter position in networks of substitution processors does not matter. International Journal of Foundations of Computer Science, 22(1), 155\u2013165. https:\/\/doi.org\/10.1142\/S0129054111007915","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"1","key":"184_CR10","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/S00224-013-9502-Z","volume":"55","author":"F Manea","year":"2014","unstructured":"Manea, F., & Truthe, B. (2014). Accepting networks of evolutionary processors with subregular filters. Theory of Computing Systems, 55(1), 84\u2013109. https:\/\/doi.org\/10.1007\/S00224-013-9502-Z","journal-title":"Theory of Computing Systems"},{"key":"184_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1051\/ITA\/2021004","volume":"55","author":"J Dassow","year":"2021","unstructured":"Dassow, J., & Truthe, B. (2021). Accepting networks of evolutionary processors with resources restricted and structure limited filters. RAIRO Theoretical Informatics and Applications, 55, 1\u201327. https:\/\/doi.org\/10.1051\/ITA\/2021004","journal-title":"RAIRO Theoretical Informatics and Applications"},{"issue":"11","key":"184_CR12","doi-asserted-by":"publisher","first-page":"1598","DOI":"10.3217\/JUCS-013-11-1598","volume":"13","author":"C Dragoi","year":"2007","unstructured":"Dragoi, C., Manea, F., & Mitrana, V. (2007). Accepting networks of evolutionary processors with filtered connections. Journal of Universal Computer Science, 13(11), 1598\u20131614. https:\/\/doi.org\/10.3217\/JUCS-013-11-1598","journal-title":"Journal of Universal Computer Science"},{"key":"184_CR13","unstructured":"Dassow, J., & Truthe, B. (2010). On networks of evolutionary processors with state limited filters. In: Bordihn, H., Freund, R., Holzer, M., Hinze, T., Kutrib, M., & Otto, F. (Eds.) Second workshop on non-classical models for automata and applications\u2014NCMA 2010, Jena, Germany, August 23\u2013August 24, 2010. Proceedings. books@ocg.at (Vol. 263, pp. 57\u201370). Vienna: Austrian Computer Society."},{"issue":"4","key":"184_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/S41965-023-00131-Y","volume":"5","author":"J\u00c1S Mart\u00edn","year":"2023","unstructured":"Mart\u00edn, J. \u00c1. S., Mitrana, V., & Paun, M. (2023). Networks of evolutionary processors: Wheel graph simulation. Journal of Membrane Computing, 5(4), 221\u2013237. https:\/\/doi.org\/10.1007\/S41965-023-00131-Y","journal-title":"Journal of Membrane Computing"},{"issue":"3","key":"184_CR15","doi-asserted-by":"publisher","first-page":"183","DOI":"10.3390\/AXIOMS10030183","volume":"10","author":"J\u00c1S Mart\u00edn","year":"2021","unstructured":"Mart\u00edn, J. \u00c1. S., & Mitrana, V. (2021). Simulations between network topologies in networks of evolutionary processors. Axioms, 10(3), 183. https:\/\/doi.org\/10.3390\/AXIOMS10030183","journal-title":"Axioms"},{"key":"184_CR16","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/J.INS.2013.12.036","volume":"265","author":"PP Alarc\u00f3n","year":"2014","unstructured":"Alarc\u00f3n, P. P., Arroyo, F., & Mitrana, V. (2014). Networks of polarized evolutionary processors. Information Sciences, 265, 189\u2013197. https:\/\/doi.org\/10.1016\/J.INS.2013.12.036","journal-title":"Information Sciences"},{"key":"184_CR17","doi-asserted-by":"publisher","unstructured":"Freund, R., Kogler, M., Rogozhin, Y., & Verlan, S. (2010). Graph-controlled insertion-deletion systems. In: McQuillan, I., & Pighizzini, G. (Eds.), Proceedings twelfth annual workshop on descriptional complexity of formal systems, DCFS 2010, Saskatoon, Canada, 8\u201310th August 2010. EPTCS (Vol. 31, pp. 88\u201398). https:\/\/doi.org\/10.4204\/EPTCS.31.11","DOI":"10.4204\/EPTCS.31.11"},{"issue":"1","key":"184_CR18","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/S00236-018-0312-2","volume":"56","author":"H Fernau","year":"2019","unstructured":"Fernau, H., Kuppusamy, L., & Raman, I. (2019). On path-controlled insertion-deletion systems. Acta Informatica, 56(1), 35\u201359. https:\/\/doi.org\/10.1007\/S00236-018-0312-2","journal-title":"Acta Informatica"},{"key":"184_CR19","doi-asserted-by":"publisher","unstructured":"Vu, M., & Fernau, H. (2020). Insertion-deletion systems with substitutions I. In: Anselmo, M., Vedova, G. D., Manea, F., & Pauly, A. (Eds.) Beyond the horizon of computability - 16th conference on computability in Europe, CiE 2020, Fisciano, Italy, June 29\u2013July 3, 2020, proceedings. Lecture notes in computer science (Vol. 12098, pp. 366\u2013378). Cham: Springer. https:\/\/doi.org\/10.1007\/978-3-030-51466-2_33","DOI":"10.1007\/978-3-030-51466-2_33"},{"issue":"1","key":"184_CR20","doi-asserted-by":"publisher","first-page":"57","DOI":"10.3233\/COM-210345","volume":"11","author":"M Vu","year":"2022","unstructured":"Vu, M., & Fernau, H. (2022). Insertion-deletion systems with substitutions I. Computability, 11(1), 57\u201383. https:\/\/doi.org\/10.3233\/COM-210345","journal-title":"Computability"},{"key":"184_CR21","volume-title":"Introduction to automata theory, languages, and computation\u2014International edition","author":"JE Hopcroft","year":"2003","unstructured":"Hopcroft, J. E., Motwani, R., & Ullman, J. D. (2003). Introduction to automata theory, languages, and computation\u2014International edition (2nd ed.). Addison-Wesley.","edition":"2"},{"key":"184_CR22","doi-asserted-by":"publisher","unstructured":"Mart\u00edn-Vide, C., Mitrana, V., P\u00e9rez-Jim\u00e9nez, M. J., & Sancho-Caparrini, F. (2003). Hybrid networks of evolutionary processors. In: Cant\u00fa-Paz, E., Foster, J. A., Deb, K., Davis, L., Roy, R., O\u2019Reilly, U., Beyer, H., Standish, R. K., Kendall, G., Wilson, S. W., Harman, M., Wegener, J., Dasgupta, D., Potter, M. A., Schultz, A. C., Dowsland, K. A., Jonoska, N., & Miller, J. F. (Eds.), Genetic and evolutionary computation\u2014GECCO 2003, genetic and evolutionary computation conference, Chicago, IL, USA, July 12\u201316, 2003. Proceedings, Part I. Lecture notes in computer science (Vol. 2723, pp. 401\u2013412). Berlin, Heidelberg: Springer. https:\/\/doi.org\/10.1007\/3-540-45105-6_49","DOI":"10.1007\/3-540-45105-6_49"},{"issue":"2","key":"184_CR23","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/S11047-007-9034-Z","volume":"7","author":"E Csuhaj-Varj\u00fa","year":"2008","unstructured":"Csuhaj-Varj\u00fa, E., & Verlan, S. (2008). On length-separating test tube systems. Natural Computing, 7(2), 167\u2013181. https:\/\/doi.org\/10.1007\/S11047-007-9034-Z","journal-title":"Natural Computing"},{"issue":"1","key":"184_CR24","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/S11047-015-9534-1","volume":"15","author":"A Alhazov","year":"2016","unstructured":"Alhazov, A., Freund, R., Rogozhin, V., & Rogozhin, Y. (2016). Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors. Natural Computing, 15(1), 51\u201368. https:\/\/doi.org\/10.1007\/S11047-015-9534-1","journal-title":"Natural Computing"},{"issue":"2","key":"184_CR25","doi-asserted-by":"publisher","first-page":"197","DOI":"10.2307\/2371809","volume":"65","author":"EL Post","year":"1943","unstructured":"Post, E. L. (1943). Formal reductions of the general combinatorial decision problem. American Journal of Mathematics, 65(2), 197\u2013215. https:\/\/doi.org\/10.2307\/2371809","journal-title":"American Journal of Mathematics"},{"key":"184_CR26","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1051\/ITA\/1991250504731","volume":"25","author":"V Geffert","year":"1991","unstructured":"Geffert, V. (1991). Normal forms for phrase-structure grammars. RAIRO Theoretical Informatics and Applications, 25, 473\u2013496. https:\/\/doi.org\/10.1051\/ITA\/1991250504731","journal-title":"RAIRO Theoretical Informatics and Applications"}],"container-title":["Journal of Membrane Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41965-025-00184-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41965-025-00184-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41965-025-00184-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T16:48:57Z","timestamp":1766076537000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41965-025-00184-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,3]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["184"],"URL":"https:\/\/doi.org\/10.1007\/s41965-025-00184-1","relation":{},"ISSN":["2523-8906","2523-8914"],"issn-type":[{"type":"print","value":"2523-8906"},{"type":"electronic","value":"2523-8914"}],"subject":[],"published":{"date-parts":[[2025,4,3]]},"assertion":[{"value":"2 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Erzs\u00e9bet Csuhaj-Varj\u00fa is member of the Editorial Board of\n                      Journal of Membrane Computing\n                      . The authors have no other conflict of interest to declare that is relevant to the content of this article. The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}