{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:08Z","timestamp":1759638488821},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2020,1]]},"abstract":"<jats:p> We study how the generative power of networks of evolutionary processors decreases if special codes and ideals are used as input and output filters of the nodes instead of arbitrary regular languages. We show that all recursively enumerable languages can be generated if the filters are right ideals or left ideals. With respect to codes, we obtain a hierarchy of evolutionary language families which is almost identical to that of the families of codes. <\/jats:p>","DOI":"10.1142\/s0129054120400055","type":"journal-article","created":{"date-parts":[[2020,1,31]],"date-time":"2020-01-31T06:55:02Z","timestamp":1580453702000},"page":"73-89","source":"Crossref","is-referenced-by-count":3,"title":["Networks with Evolutionary Processors and Ideals and Codes as Filters"],"prefix":"10.1142","volume":"31","author":[{"given":"J\u00fcrgen","family":"Dassow","sequence":"first","affiliation":[{"name":"Fakult\u00e4t f\u00fcr Informatik, Otto-von-Guericke-Universit\u00e4t Magdeburg, PSF 4120, 39016 Magdeburg, Germany"}]},{"given":"Bianca","family":"Truthe","sequence":"additional","affiliation":[{"name":"Institut f\u00fcr Informatik, Justus-Liebig-Universit\u00e4t Gie\u00dfen, Arndtstr. 2, 35392 Gie\u00dfen, Germany"}]}],"member":"219","published-online":{"date-parts":[[2020,1,29]]},"reference":[{"key":"S0129054120400055BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45720-8_74"},{"key":"S0129054120400055BIB002","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-003-0114-y"},{"key":"S0129054120400055BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-62844-4_22"},{"issue":"1","key":"S0129054120400055BIB004","first-page":"143","volume":"23","author":"Dassow J.","year":"2018","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"S0129054120400055BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-012-0172-0"},{"issue":"4","key":"S0129054120400055BIB006","first-page":"251","volume":"21","author":"Gao Y.","year":"2016","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"S0129054120400055BIB008","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-013-9502-z"},{"key":"S0129054120400055BIB009","series-title":"LNCS","first-page":"235","volume-title":"DNA Computing \u2014 10th International Workshop on DNA Computing","volume":"3384","author":"Margenstern M.","year":"2004"},{"key":"S0129054120400055BIB010","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59126-6"},{"key":"S0129054120400055BIB011","volume-title":"Free Monoids and Languages","author":"Shyr H.-J.","year":"1991"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054120400055","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,31]],"date-time":"2020-01-31T06:55:08Z","timestamp":1580453708000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054120400055"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":10,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["10.1142\/S0129054120400055"],"URL":"https:\/\/doi.org\/10.1142\/s0129054120400055","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1]]}}}