{"id":"https://openalex.org/W1988206220","doi":"https://doi.org/10.1080/00207160701210760","title":"On the recognition of context-free languages using accepting hybrid networks of evolutionary processors","display_name":"On the recognition of context-free languages using accepting hybrid networks of evolutionary processors","publication_year":2007,"publication_date":"2007-03-01","ids":{"openalex":"https://openalex.org/W1988206220","doi":"https://doi.org/10.1080/00207160701210760","mag":"1988206220"},"language":"en","primary_location":{"id":"doi:10.1080/00207160701210760","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160701210760","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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","Faculty of Mathematics and Computer Science , University of Bucharest , Bucharest , Romania"],"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":"Faculty of Mathematics and Computer Science , University of Bucharest , Bucharest , Romania","institution_ids":["https://openalex.org/I141595442"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5006548981"],"corresponding_institution_ids":["https://openalex.org/I141595442"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07511118,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"84","issue":"3","first_page":"273","last_page":"285"},"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/T11567","display_name":"semigroups and automata theory","score":0.9926999807357788,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9908999800682068,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.8185745477676392},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7283576726913452},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.6245822906494141},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.48502272367477417},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.46824920177459717},{"id":"https://openalex.org/keywords/non-deterministic-turing-machine","display_name":"Non-deterministic Turing machine","score":0.4531184136867523},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.4461527466773987},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.44125255942344666},{"id":"https://openalex.org/keywords/turing","display_name":"Turing","score":0.4410315454006195},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.41303712129592896},{"id":"https://openalex.org/keywords/probabilistic-turing-machine","display_name":"Probabilistic Turing machine","score":0.41033488512039185},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.28308603167533875},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2759515643119812},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2307487428188324}],"concepts":[{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.8185745477676392},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7283576726913452},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.6245822906494141},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48502272367477417},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.46824920177459717},{"id":"https://openalex.org/C15190523","wikidata":"https://www.wikidata.org/wiki/Q1190223","display_name":"Non-deterministic Turing machine","level":5,"score":0.4531184136867523},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4461527466773987},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.44125255942344666},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.4410315454006195},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.41303712129592896},{"id":"https://openalex.org/C144271403","wikidata":"https://www.wikidata.org/wiki/Q1191836","display_name":"Probabilistic Turing machine","level":5,"score":0.41033488512039185},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.28308603167533875},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2759515643119812},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2307487428188324},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207160701210760","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160701210760","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320323444","display_name":"Autoritatea National\u0103 pentru Cercetare Stiintific\u0103","ror":"https://ror.org/03padf885"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W68923906","https://openalex.org/W1483121990","https://openalex.org/W1597959121","https://openalex.org/W1862790798","https://openalex.org/W2002089154","https://openalex.org/W2088102138","https://openalex.org/W2096200279","https://openalex.org/W2492317011","https://openalex.org/W2494259042","https://openalex.org/W4285719527","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W2547364878","https://openalex.org/W2348596562","https://openalex.org/W1662868588","https://openalex.org/W1760285719","https://openalex.org/W2070488416","https://openalex.org/W293759077","https://openalex.org/W2339875149","https://openalex.org/W3014863312","https://openalex.org/W2044455065","https://openalex.org/W2484712192"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,53,65,72,99,158,163],"approach":[4,87],"the":[5,13,60,70,75,84,95,104,109,115,119,123,130,137,144,154,160,177],"problem":[6],"of":[7,15,28,97,106,111,114,126,132,139,146,149,179,190],"constructing":[8],"an":[9,56,173],"accepting":[10,63,83,153],"device":[11],"for":[12,43,118,176,186],"class":[14],"context-free":[16,45],"languages,":[17,129],"based":[18],"on":[19,103],"a":[20,49,67,79,90,150],"newly":[21],"defined":[22],"computational":[23],"model:":[24],"Accepting":[25],"Hybrid":[26],"Network":[27],"Evolutionary":[29],"Processors":[30],"(AHNEPs).":[31],"Although":[32],"it":[33],"is":[34,134],"known":[35,185],"that":[36,58,184],"AHNEPs":[37,71],"are":[38],"Turing":[39,61,151],"complete,":[40],"and,":[41],"consequently,":[42],"every":[44],"language,":[46,52],"seen":[47],"as":[48],"recursively":[50,127],"enumerable":[51,128],"can":[54],"construct":[55],"AHNEP":[57,93,161],"simulates":[59],"machine":[62,152],"it,":[64],"choose":[66],"direct":[68],"approach:":[69],"design":[73],"simulate":[74],"computation":[76],"done":[77],"by":[78],"non-deterministic":[80],"push-down":[81],"automata":[82],"language.":[85,156],"This":[86],"leads":[88],"to":[89,167,183],"more":[91],"economic":[92],"since":[94],"number":[96,105,110,131,138,145,178],"processors":[98,133,180],"use":[100],"depends":[101],"linearly":[102],"states":[107],"and":[108],"working":[112,147],"symbols":[113,148],"automaton,":[116],"while":[117],"network":[120],"obtained":[121],"in":[122,136,143,165],"general":[124],"case":[125],"linear":[135],"states,":[140],"but":[141],"quadratic":[142],"given":[155],"Finally,":[157],"particularize":[159],"architecture":[162],"proposed":[164],"order":[166],"recognize":[168],"regular":[169],"languages.":[170],"We":[171],"obtain":[172],"upper":[174],"bound":[175],"needed":[181],"close":[182],"generating":[187],"hybrid":[188],"networks":[189],"evolutionary":[191],"processors.":[192]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}