{"id":"https://openalex.org/W2101285522","doi":"https://doi.org/10.1017/s0960129507006202","title":"On the size complexity of universal accepting hybrid networks of evolutionary processors","display_name":"On the size complexity of universal accepting hybrid networks of evolutionary processors","publication_year":2007,"publication_date":"2007-08-01","ids":{"openalex":"https://openalex.org/W2101285522","doi":"https://doi.org/10.1017/s0960129507006202","mag":"2101285522"},"language":"en","primary_location":{"id":"doi:10.1017/s0960129507006202","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0960129507006202","pdf_url":null,"source":{"id":"https://openalex.org/S101766102","display_name":"Mathematical Structures in Computer Science","issn_l":"0960-1295","issn":["0960-1295","1469-8072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Structures in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006548981","display_name":"Flor\u00edn Manea","orcid":"https://orcid.org/0000-0001-6094-3324"},"institutions":[{"id":"https://openalex.org/I141595442","display_name":"University of Bucharest","ror":"https://ror.org/02x2v6p15","country_code":"RO","type":"education","lineage":["https://openalex.org/I141595442"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"FLORIN MANEA","raw_affiliation_strings":["Faculty of Mathematics and Computer Science, University of Bucharest, Str. Academiei 14, 70109, Bucharest, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Computer Science, University of Bucharest, Str. Academiei 14, 70109, Bucharest, Romania","institution_ids":["https://openalex.org/I141595442"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025443239","display_name":"Carlos Mart\u0131\u0301n-Vide","orcid":"https://orcid.org/0000-0003-1670-6000"},"institutions":[{"id":"https://openalex.org/I55952717","display_name":"Universitat Rovira i Virgili","ror":"https://ror.org/00g5sqv46","country_code":"ES","type":"education","lineage":["https://openalex.org/I55952717"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"CARLOS MARTIN-VIDE","raw_affiliation_strings":["Research Group on Mathematical Linguistics, Rovira i Virgili University, P\u00e7a Imperial T\u00e0rraco 1, 43005 Tarragona, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Group on Mathematical Linguistics, Rovira i Virgili University, P\u00e7a Imperial T\u00e0rraco 1, 43005 Tarragona, Spain","institution_ids":["https://openalex.org/I55952717"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055787693","display_name":"V\u00edctor Mitrana","orcid":"https://orcid.org/0000-0002-1457-8933"},"institutions":[{"id":"https://openalex.org/I141595442","display_name":"University of Bucharest","ror":"https://ror.org/02x2v6p15","country_code":"RO","type":"education","lineage":["https://openalex.org/I141595442"]},{"id":"https://openalex.org/I55952717","display_name":"Universitat Rovira i Virgili","ror":"https://ror.org/00g5sqv46","country_code":"ES","type":"education","lineage":["https://openalex.org/I55952717"]}],"countries":["ES","RO"],"is_corresponding":false,"raw_author_name":"VICTOR MITRANA","raw_affiliation_strings":["Faculty of Mathematics and Computer Science, University of Bucharest, Str. Academiei 14, 70109, Bucharest, Romania","Research Group on Mathematical Linguistics, Rovira i Virgili University, P\u00e7a Imperial T\u00e0rraco 1, 43005 Tarragona, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Computer Science, University of Bucharest, Str. Academiei 14, 70109, Bucharest, Romania","institution_ids":["https://openalex.org/I141595442"]},{"raw_affiliation_string":"Research Group on Mathematical Linguistics, Rovira i Virgili University, P\u00e7a Imperial T\u00e0rraco 1, 43005 Tarragona, Spain","institution_ids":["https://openalex.org/I55952717"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5006548981"],"corresponding_institution_ids":["https://openalex.org/I141595442"],"apc_list":null,"apc_paid":null,"fwci":1.4799,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.81314748,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"17","issue":"4","first_page":"753","last_page":"771"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.7748197317123413},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7649545669555664},{"id":"https://openalex.org/keywords/description-number","display_name":"Description number","score":0.6124631762504578},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5922403335571289},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.5501435995101929},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.5292375087738037},{"id":"https://openalex.org/keywords/subnetwork","display_name":"Subnetwork","score":0.5155953764915466},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5151656866073608},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.45896056294441223},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.43694159388542175},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.422549307346344},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32217079401016235},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28262603282928467},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23755833506584167}],"concepts":[{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.7748197317123413},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7649545669555664},{"id":"https://openalex.org/C179061269","wikidata":"https://www.wikidata.org/wiki/Q5263786","display_name":"Description number","level":5,"score":0.6124631762504578},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5922403335571289},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.5501435995101929},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.5292375087738037},{"id":"https://openalex.org/C2780186347","wikidata":"https://www.wikidata.org/wiki/Q11414","display_name":"Subnetwork","level":2,"score":0.5155953764915466},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5151656866073608},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.45896056294441223},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.43694159388542175},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.422549307346344},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32217079401016235},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28262603282928467},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23755833506584167},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0960129507006202","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0960129507006202","pdf_url":null,"source":{"id":"https://openalex.org/S101766102","display_name":"Mathematical Structures in Computer Science","issn_l":"0960-1295","issn":["0960-1295","1469-8072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Structures in Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.6200000047683716,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W35024350","https://openalex.org/W64579671","https://openalex.org/W68923906","https://openalex.org/W1483121990","https://openalex.org/W1561605958","https://openalex.org/W1597959121","https://openalex.org/W1862790798","https://openalex.org/W2011039300","https://openalex.org/W2021416330","https://openalex.org/W2056592718","https://openalex.org/W2061045534","https://openalex.org/W2088102138","https://openalex.org/W2096200279","https://openalex.org/W2113997157","https://openalex.org/W2128325638","https://openalex.org/W2158365276","https://openalex.org/W2276729638","https://openalex.org/W2335627691","https://openalex.org/W2911830436","https://openalex.org/W4205872288","https://openalex.org/W4210461990","https://openalex.org/W4253060067"],"related_works":["https://openalex.org/W2484712192","https://openalex.org/W1604909338","https://openalex.org/W1978271909","https://openalex.org/W584827857","https://openalex.org/W2739700767","https://openalex.org/W2403127738","https://openalex.org/W1970213482","https://openalex.org/W2101285522","https://openalex.org/W1902283076","https://openalex.org/W168794163"],"abstract_inverted_index":{"In":[0,69,101],"this":[1],"paper":[2],"we":[3,105],"discuss":[4],"the":[5,49,65,70,73,85,88,96,102,154],"following":[6],"interesting":[7],"question":[8,26],"about":[9],"accepting":[10],"hybrid":[11],"networks":[12],"of":[13,78,87,91,132,149],"evolutionary":[14],"processors":[15,30,79],"(AHNEP),":[16],"which":[17],"are":[18,31,46],"a":[19,35,39,56,76,92,111,129,137,141,146],"recently":[20],"introduced":[21],"bio-inspired":[22],"computing":[23],"model.":[24],"The":[25,121],"is:":[27],"how":[28],"many":[29],"required":[32],"in":[33],"such":[34],"network":[36,74],"to":[37],"recognise":[38],"given":[40,97,155],"language":[41,98],"L":[42,54,99],"?":[43],"Two":[44],"answers":[45,62],"proposed":[47],"for":[48],"most":[50],"general":[51],"case,":[52],"when":[53],"is":[55,81],"recursively":[57,118],"enumerable":[58,119],"language,":[59],"and":[60,143],"both":[61],"improve":[63],"on":[64,153],"previously":[66],"known":[67],"bounds.":[68],"first":[71],"case":[72,104],"has":[75,124],"number":[77,148],"that":[80,107],"linearly":[82],"bounded":[83],"by":[84],"cardinality":[86],"tape":[89],"alphabet":[90],"Turing":[93],"machine":[94],"recognising":[95],".":[100],"second":[103,122],"show":[106],"an":[108],"AHNEP":[109,139],"with":[110],"fixed":[112],"underlying":[113],"structure":[114],"can":[115],"accept":[116],"any":[117],"language.":[120,156],"construction":[123],"another":[125],"useful":[126],"property":[127],"from":[128],"practical":[130],"point":[131],"view":[133],"as":[134,140],"it":[135],"includes":[136],"universal":[138],"subnetwork,":[142],"hence":[144],"only":[145],"limited":[147],"its":[150],"parameters":[151],"depend":[152]},"counts_by_year":[{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}