{"id":"https://openalex.org/W2404668734","doi":"https://doi.org/10.25596/jalc-2010-155","title":"Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections","display_name":"Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections","publication_year":2009,"publication_date":"2009-07-29","ids":{"openalex":"https://openalex.org/W2404668734","doi":"https://doi.org/10.25596/jalc-2010-155","mag":"2404668734"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.314.52","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.314.52","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0907.5130v1.pdf","raw_type":"text"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.0907.5130","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5107974625","display_name":"Remco Loos","orcid":"https://orcid.org/0000-0002-9850-6821"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Loos, Remco","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006548981","display_name":"Flor\u00edn Manea","orcid":"https://orcid.org/0000-0001-6094-3324"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Manea, Florin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5103057187","display_name":"Victor Mitrana","orcid":"https://orcid.org/0000-0002-3049-6428"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mitrana, Victor","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"15","issue":null,"first_page":"155","last_page":"174"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9991000294685364,"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.9991000294685364,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10621","display_name":"Gene Regulatory Network Analysis","score":0.9943000078201294,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.801876425743103},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7775165438652039},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.7483262419700623},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.7237118482589722},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7136150598526001},{"id":"https://openalex.org/keywords/nspace","display_name":"NSPACE","score":0.6409695148468018},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5743047595024109},{"id":"https://openalex.org/keywords/super-recursive-algorithm","display_name":"Super-recursive algorithm","score":0.5422564148902893},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5175706744194031},{"id":"https://openalex.org/keywords/turing","display_name":"Turing","score":0.49564921855926514},{"id":"https://openalex.org/keywords/non-deterministic-turing-machine","display_name":"Non-deterministic Turing machine","score":0.4710271954536438},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.46072983741760254},{"id":"https://openalex.org/keywords/probabilistic-turing-machine","display_name":"Probabilistic Turing machine","score":0.4526715576648712},{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.45215296745300293},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30500754714012146},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.266741544008255},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.07387542724609375}],"concepts":[{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.801876425743103},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7775165438652039},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.7483262419700623},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.7237118482589722},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7136150598526001},{"id":"https://openalex.org/C201958364","wikidata":"https://www.wikidata.org/wiki/Q1756295","display_name":"NSPACE","level":5,"score":0.6409695148468018},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5743047595024109},{"id":"https://openalex.org/C31402856","wikidata":"https://www.wikidata.org/wiki/Q5295939","display_name":"Super-recursive algorithm","level":5,"score":0.5422564148902893},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5175706744194031},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.49564921855926514},{"id":"https://openalex.org/C15190523","wikidata":"https://www.wikidata.org/wiki/Q1190223","display_name":"Non-deterministic Turing machine","level":5,"score":0.4710271954536438},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.46072983741760254},{"id":"https://openalex.org/C144271403","wikidata":"https://www.wikidata.org/wiki/Q1191836","display_name":"Probabilistic Turing machine","level":5,"score":0.4526715576648712},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.45215296745300293},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30500754714012146},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.266741544008255},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.07387542724609375},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.314.52","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.314.52","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0907.5130v1.pdf","raw_type":"text"},{"id":"doi:10.48550/arxiv.0907.5130","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.0907.5130","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"doi:10.25596/jalc-2010-155","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2010-155","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"mag:2404668734","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/jalc/jalc15.html#LoosMM10","pdf_url":null,"source":{"id":"https://openalex.org/S62907800","display_name":"Journal of automata, languages and combinatorics","issn_l":"1430-189X","issn":["1430-189X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310313929","host_organization_name":"University of Giessen","host_organization_lineage":["https://openalex.org/P4310313929"],"host_organization_lineage_names":["University of Giessen"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Journal of automata, languages and combinatorics","raw_type":null}],"best_oa_location":{"id":"doi:10.48550/arxiv.0907.5130","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.0907.5130","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3146512859","https://openalex.org/W2096200279","https://openalex.org/W2144557478","https://openalex.org/W2184601028","https://openalex.org/W1981914472","https://openalex.org/W2193259096","https://openalex.org/W1503923843","https://openalex.org/W1553952730","https://openalex.org/W2015895898","https://openalex.org/W1965022641","https://openalex.org/W2152058358","https://openalex.org/W2267378935","https://openalex.org/W3099579506","https://openalex.org/W2069149028","https://openalex.org/W2914652086","https://openalex.org/W2186500560","https://openalex.org/W2134311920","https://openalex.org/W1722394934","https://openalex.org/W2131832709","https://openalex.org/W2083747727"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,74],"present":[4],"some":[5],"results":[6],"regarding":[7],"the":[8,43,48,100,105],"size":[9,29,49],"complexity":[10,97],"of":[11,14,28,50,66,95,107],"Accepting":[12],"Networks":[13],"Evolutionary":[15],"Processors":[16],"with":[17,83],"Filtered":[18],"Connections":[19],"(ANEPFCs).":[20],"We":[21,56],"show":[22],"that":[23],"there":[24],"are":[25],"universal":[26,51],"ANEPFCs":[27,52,82],"10,":[30],"by":[31,70],"devising":[32],"a":[33,59,110],"method":[34],"for":[35,47,104],"simulating":[36,112],"2-Tag":[37],"Systems.":[38],"This":[39],"result":[40],"significantly":[41],"improves":[42],"known":[44,101],"upper":[45,102],"bound":[46,103],"which":[53],"is":[54,117],"18.":[55],"also":[57],"propose":[58],"new,":[60],"computationally":[61],"and":[62],"descriptionally":[63],"efficient":[64],"simulation":[65],"nondeterministic":[67,92],"Turing":[68,93,115],"machines":[69],"ANEPFCs.":[71],"More":[72],"precisely,":[73],"describe":[75],"(informally,":[76],"due":[77],"to":[78,121],"space":[79],"limitations)":[80],"how":[81],"16":[84],"nodes":[85,108],"can":[86],"simulate":[87],"in":[88,109],"O(f(n))":[89],"time":[90,96],"any":[91],"machine":[94,116],"f(n).":[98],"Thus":[99],"number":[106],"network":[111],"an":[113],"arbitrary":[114],"decreased":[118],"from":[119],"26":[120],"16.":[122]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}