{"id":"https://openalex.org/W2020497406","doi":"https://doi.org/10.1080/00207160701326764","title":"A general approach for building combinational<i>P</i>automata","display_name":"A general approach for building combinational<i>P</i>automata","publication_year":2007,"publication_date":"2007-11-22","ids":{"openalex":"https://openalex.org/W2020497406","doi":"https://doi.org/10.1080/00207160701326764","mag":"2020497406"},"language":"en","primary_location":{"id":"doi:10.1080/00207160701326764","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160701326764","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/A5028722677","display_name":"Huan Long","orcid":"https://orcid.org/0000-0002-1328-6197"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Huan Long","raw_affiliation_strings":["BASICS, Department of Computer Science and Engineering , Shanghai Jiao Tong University , Shanghai, 200240, P.R. China","BASICS, Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, P.R. China#TAB#"],"affiliations":[{"raw_affiliation_string":"BASICS, Department of Computer Science and Engineering , Shanghai Jiao Tong University , Shanghai, 200240, P.R. China","institution_ids":["https://openalex.org/I183067930"]},{"raw_affiliation_string":"BASICS, Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, P.R. China#TAB#","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101580261","display_name":"Yuxi Fu","orcid":"https://orcid.org/0000-0001-6429-7550"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yuxi Fu","raw_affiliation_strings":["BASICS, Department of Computer Science and Engineering , Shanghai Jiao Tong University , Shanghai, 200240, P.R. China","BASICS, Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, P.R. China#TAB#"],"affiliations":[{"raw_affiliation_string":"BASICS, Department of Computer Science and Engineering , Shanghai Jiao Tong University , Shanghai, 200240, P.R. China","institution_ids":["https://openalex.org/I183067930"]},{"raw_affiliation_string":"BASICS, Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, P.R. China#TAB#","institution_ids":["https://openalex.org/I183067930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5028722677"],"corresponding_institution_ids":["https://openalex.org/I183067930"],"apc_list":null,"apc_paid":null,"fwci":0.1309,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.51416778,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"84","issue":"12","first_page":"1715","last_page":"1730"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":1.0,"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":1.0,"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.9991000294685364,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9919999837875366,"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/concatenation","display_name":"Concatenation (mathematics)","score":0.8604186177253723},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.6883108615875244},{"id":"https://openalex.org/keywords/mobile-automaton","display_name":"Mobile automaton","score":0.6815409064292908},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.6378259658813477},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6359330415725708},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.5913798809051514},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.5785895586013794},{"id":"https://openalex.org/keywords/\u03c9-automaton","display_name":"\u03c9-automaton","score":0.5782400369644165},{"id":"https://openalex.org/keywords/regular-expression","display_name":"Regular expression","score":0.5315492153167725},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46291476488113403},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4608426094055176},{"id":"https://openalex.org/keywords/continuous-spatial-automaton","display_name":"Continuous spatial automaton","score":0.45019271969795227},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.4373343884944916},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4153825640678406},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40892156958580017},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35852038860321045},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19147899746894836},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12880152463912964}],"concepts":[{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.8604186177253723},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.6883108615875244},{"id":"https://openalex.org/C50348692","wikidata":"https://www.wikidata.org/wiki/Q6887056","display_name":"Mobile automaton","level":4,"score":0.6815409064292908},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.6378259658813477},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6359330415725708},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.5913798809051514},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.5785895586013794},{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.5782400369644165},{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.5315492153167725},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46291476488113403},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4608426094055176},{"id":"https://openalex.org/C75745568","wikidata":"https://www.wikidata.org/wiki/Q5165519","display_name":"Continuous spatial automaton","level":5,"score":0.45019271969795227},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4373343884944916},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4153825640678406},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40892156958580017},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35852038860321045},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19147899746894836},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12880152463912964},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207160701326764","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160701326764","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":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W195162142","https://openalex.org/W1584587517","https://openalex.org/W1834026245","https://openalex.org/W1971681503","https://openalex.org/W2013622356","https://openalex.org/W2119442232","https://openalex.org/W2158708642","https://openalex.org/W2246841888","https://openalex.org/W2546620643","https://openalex.org/W2914245911","https://openalex.org/W4241604193","https://openalex.org/W4292002128"],"related_works":["https://openalex.org/W4386400090","https://openalex.org/W4382203044","https://openalex.org/W4310283533","https://openalex.org/W2321667159","https://openalex.org/W1978638999","https://openalex.org/W2012286375","https://openalex.org/W2560814204","https://openalex.org/W2058117339","https://openalex.org/W1569273857","https://openalex.org/W2322570347"],"abstract_inverted_index":{"In":[0],"traditional":[1],"automata":[2,23,55,73],"theory,":[3],"the":[4,14,19,28,64,76,78,80,84,88],"closure":[5],"with":[6,56],"respect":[7],"to":[8,33,40,118],"certain":[9,25],"operations":[10,26],"is":[11],"one":[12],"of":[13,21,87],"most":[15],"investigated":[16],"properties,":[17],"especially":[18],"methods":[20,70],"constructing":[22,72],"for":[24,43,71,102],"among":[27],"given":[29,89],"sub-automata.":[30],"However,":[31],"up":[32],"now":[34],"less":[35],"effort":[36],"has":[37],"been":[38],"addressed":[39],"this":[41],"question":[42],"P":[44,54,96],"automata.":[45,97],"As":[46],"an":[47],"improvement":[48],"on":[49],"earlier":[50],"results,":[51],"we":[52,110],"introduce":[53],"communication":[57],"and":[58],"active":[59],"membrane":[60],"rules":[61],"working":[62],"in":[63],"initial":[65],"mode":[66],"(CAIP).":[67],"We":[68,98],"present":[69],"that":[74,101],"recognize":[75],"Union,":[77],"Concatenation,":[79],"Kleene":[81],"Closure,":[82],"or":[83],"\u03c9":[85],"Closure":[86],"languages":[90],"which":[91],"are":[92],"represented":[93],"by":[94,106],"some":[95],"also":[99],"show":[100],"any":[103],"language":[104],"denoted":[105],"a":[107,114],"regular":[108],"expression,":[109],"can":[111],"readily":[112],"construct":[113],"CAIP":[115],"automaton":[116],"corresponding":[117],"it.":[119]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}