{"id":"https://openalex.org/W1980972224","doi":"https://doi.org/10.1007/s00236-009-0113-8","title":"Small universal accepting hybrid networks of evolutionary processors","display_name":"Small universal accepting hybrid networks of evolutionary processors","publication_year":2009,"publication_date":"2009-12-17","ids":{"openalex":"https://openalex.org/W1980972224","doi":"https://doi.org/10.1007/s00236-009-0113-8","mag":"1980972224"},"language":"en","primary_location":{"id":"doi:10.1007/s00236-009-0113-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00236-009-0113-8","pdf_url":null,"source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","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/A5107974625","display_name":"Remco Loos","orcid":"https://orcid.org/0000-0002-9850-6821"},"institutions":[{"id":"https://openalex.org/I1303153112","display_name":"European Bioinformatics Institute","ror":"https://ror.org/02catss52","country_code":"GB","type":"facility","lineage":["https://openalex.org/I1303153112","https://openalex.org/I4210138560"]},{"id":"https://openalex.org/I87048295","display_name":"Wellcome Trust","ror":"https://ror.org/029chgv08","country_code":"GB","type":"nonprofit","lineage":["https://openalex.org/I87048295"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Remco Loos","raw_affiliation_strings":["EMBL, European Bioinformatics Institute, Wellcome Trust Genome Campus, Hinxton, Cambridge, CB10 1SD, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EMBL, European Bioinformatics Institute, Wellcome Trust Genome Campus, Hinxton, Cambridge, CB10 1SD, UK","institution_ids":["https://openalex.org/I1303153112","https://openalex.org/I87048295"]}]},{"author_position":"middle","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"]},{"id":"https://openalex.org/I95793202","display_name":"Otto-von-Guericke-Universit\u00e4t Magdeburg","ror":"https://ror.org/00ggpsq73","country_code":"DE","type":"education","lineage":["https://openalex.org/I95793202"]}],"countries":["DE","RO"],"is_corresponding":false,"raw_author_name":"Florin Manea","raw_affiliation_strings":["Faculty of Computer Science, Otto-von-Guericke University of Magdeburg, PSF 4120, 39016, Magdeburg, Germany","Faculty of Mathematics and Computer Science, University of Bucharest, Academiei 14, 010014, Bucharest, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, Otto-von-Guericke University of Magdeburg, PSF 4120, 39016, Magdeburg, Germany","institution_ids":["https://openalex.org/I95793202"]},{"raw_affiliation_string":"Faculty of Mathematics and Computer Science, University of Bucharest, Academiei 14, 010014, Bucharest, Romania","institution_ids":["https://openalex.org/I141595442"]}]},{"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/I60053951","display_name":"Universitat Polit\u00e8cnica de Val\u00e8ncia","ror":"https://ror.org/01460j859","country_code":"ES","type":"education","lineage":["https://openalex.org/I60053951"]}],"countries":["ES","RO"],"is_corresponding":true,"raw_author_name":"Victor Mitrana","raw_affiliation_strings":["Department of Information Systems and Computation, Technical University of Valencia, Camino de Vera s/n, 46022, Valencia, Spain","Faculty of Mathematics and Computer Science, University of Bucharest, Academiei 14, 010014, Bucharest, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Systems and Computation, Technical University of Valencia, Camino de Vera s/n, 46022, Valencia, Spain","institution_ids":["https://openalex.org/I60053951"]},{"raw_affiliation_string":"Faculty of Mathematics and Computer Science, University of Bucharest, Academiei 14, 010014, Bucharest, Romania","institution_ids":["https://openalex.org/I141595442"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5055787693"],"corresponding_institution_ids":["https://openalex.org/I141595442","https://openalex.org/I60053951"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":null,"fwci":0.6296,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.65944689,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"47","issue":"2","first_page":"133","last_page":"146"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9983999729156494,"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.9983999729156494,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9898999929428101,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.7917954325675964},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7634420394897461},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.7477107644081116},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.7465123534202576},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.73343825340271},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7235895395278931},{"id":"https://openalex.org/keywords/nspace","display_name":"NSPACE","score":0.6145261526107788},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5930052399635315},{"id":"https://openalex.org/keywords/super-recursive-algorithm","display_name":"Super-recursive algorithm","score":0.5233948826789856},{"id":"https://openalex.org/keywords/non-deterministic-turing-machine","display_name":"Non-deterministic Turing machine","score":0.511440634727478},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47747802734375},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4679041802883148},{"id":"https://openalex.org/keywords/probabilistic-turing-machine","display_name":"Probabilistic Turing machine","score":0.4663015902042389},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.44330739974975586},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.43561217188835144},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.42151811718940735},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33625954389572144},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2674444317817688},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.09834599494934082}],"concepts":[{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.7917954325675964},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7634420394897461},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.7477107644081116},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.7465123534202576},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.73343825340271},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7235895395278931},{"id":"https://openalex.org/C201958364","wikidata":"https://www.wikidata.org/wiki/Q1756295","display_name":"NSPACE","level":5,"score":0.6145261526107788},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5930052399635315},{"id":"https://openalex.org/C31402856","wikidata":"https://www.wikidata.org/wiki/Q5295939","display_name":"Super-recursive algorithm","level":5,"score":0.5233948826789856},{"id":"https://openalex.org/C15190523","wikidata":"https://www.wikidata.org/wiki/Q1190223","display_name":"Non-deterministic Turing machine","level":5,"score":0.511440634727478},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47747802734375},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4679041802883148},{"id":"https://openalex.org/C144271403","wikidata":"https://www.wikidata.org/wiki/Q1191836","display_name":"Probabilistic Turing machine","level":5,"score":0.4663015902042389},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.44330739974975586},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.43561217188835144},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.42151811718940735},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33625954389572144},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2674444317817688},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.09834599494934082},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00236-009-0113-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00236-009-0113-8","pdf_url":null,"source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W29228223","https://openalex.org/W1968727765","https://openalex.org/W2021416330","https://openalex.org/W2024115286","https://openalex.org/W2037124586","https://openalex.org/W2065105492","https://openalex.org/W2096200279","https://openalex.org/W2101285522","https://openalex.org/W2125495920","https://openalex.org/W2158365276","https://openalex.org/W2326418800","https://openalex.org/W2338405082","https://openalex.org/W2586782524","https://openalex.org/W4230463006","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2070488416","https://openalex.org/W2059442002","https://openalex.org/W2022693656","https://openalex.org/W1531426191","https://openalex.org/W3205703342","https://openalex.org/W2168431435","https://openalex.org/W21360042","https://openalex.org/W1555195996","https://openalex.org/W4286769568","https://openalex.org/W1982159199"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}