{"id":"https://openalex.org/W2772680127","doi":"https://doi.org/10.1142/s012905411740007x","title":"A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata","display_name":"A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata","publication_year":2017,"publication_date":"2017-08-01","ids":{"openalex":"https://openalex.org/W2772680127","doi":"https://doi.org/10.1142/s012905411740007x","mag":"2772680127"},"language":"en","primary_location":{"id":"doi:10.1142/s012905411740007x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905411740007x","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of 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/A5056046829","display_name":"Akio Fujiyoshi","orcid":null},"institutions":[{"id":"https://openalex.org/I65143321","display_name":"Hitachi (Japan)","ror":"https://ror.org/02exqgm79","country_code":"JP","type":"company","lineage":["https://openalex.org/I65143321"]},{"id":"https://openalex.org/I6178835","display_name":"Ibaraki University","ror":"https://ror.org/00sjd5653","country_code":"JP","type":"education","lineage":["https://openalex.org/I6178835"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Akio Fujiyoshi","raw_affiliation_strings":["Department of Computer and Information Sciences, Ibaraki University, 4-12-1 Nakanarusawa, Hitachi, Ibaraki 316-8511, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Sciences, Ibaraki University, 4-12-1 Nakanarusawa, Hitachi, Ibaraki 316-8511, Japan","institution_ids":["https://openalex.org/I6178835","https://openalex.org/I65143321"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056046829"],"corresponding_institution_ids":["https://openalex.org/I6178835","https://openalex.org/I65143321"],"apc_list":null,"apc_paid":null,"fwci":0.2271,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.5834222,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"28","issue":"05","first_page":"563","last_page":"581"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T11567","display_name":"semigroups and automata theory","score":0.9973000288009644,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/tree","display_name":"Tree (set theory)","score":0.6702650189399719},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6611436605453491},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.5942003726959229},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5448063611984253},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.5028788447380066},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.47947701811790466},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47088345885276794},{"id":"https://openalex.org/keywords/\u03c9-automaton","display_name":"\u03c9-automaton","score":0.4545218050479889},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.42319169640541077},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.42139697074890137},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4201936423778534},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36128246784210205},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34350624680519104},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.3076208233833313},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.3067634701728821},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.2606813907623291},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2176894247531891},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.17211464047431946}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6702650189399719},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6611436605453491},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.5942003726959229},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5448063611984253},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.5028788447380066},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.47947701811790466},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47088345885276794},{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.4545218050479889},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.42319169640541077},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.42139697074890137},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4201936423778534},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36128246784210205},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34350624680519104},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3076208233833313},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.3067634701728821},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.2606813907623291},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2176894247531891},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.17211464047431946}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s012905411740007x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905411740007x","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W2028357390","https://openalex.org/W2037121285","https://openalex.org/W2038674294","https://openalex.org/W2038955206","https://openalex.org/W2064796716","https://openalex.org/W2066585576","https://openalex.org/W2086823052","https://openalex.org/W2142055019","https://openalex.org/W4235239597"],"related_works":["https://openalex.org/W2137024331","https://openalex.org/W2907557140","https://openalex.org/W4311420001","https://openalex.org/W2151788193","https://openalex.org/W2172205179","https://openalex.org/W2100229833","https://openalex.org/W2137997862","https://openalex.org/W2773952476","https://openalex.org/W1987994907","https://openalex.org/W2089201581"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,28,63,90],"practical":[4,96],"algorithm":[5,30,51],"for":[6,19,31,35],"the":[7,24,32,43,46,49,60,71,74,78,84,93],"uniform":[8],"membership":[9,33],"problem":[10,34],"of":[11,14,27,37,48,62,73,80,92],"labeled":[12],"multidigraphs":[13],"tree-width":[15,39,79],"at":[16],"most":[17],"2":[18],"spanning":[20],"tree":[21,75,85],"automata.":[22],"Though":[23],"theoretical":[25],"existence":[26],"linear-time":[29,50],"graphs":[36],"bounded":[38],"was":[40],"shown":[41],"in":[42,70,95],"previous":[44],"study,":[45],"implementation":[47],"is":[52,68],"expected":[53],"to":[54],"be":[55,89],"impractical":[56],"because":[57],"it":[58],"requires":[59],"construction":[61],"finite-state":[64],"automaton":[65,76,86],"whose":[66],"size":[67,72],"super-exponential":[69],"and":[77],"graphs.":[81],"In":[82],"addition,":[83],"itself":[87],"should":[88],"part":[91],"input":[94],"situations.":[97]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}