{"id":"https://openalex.org/W2528622498","doi":"https://doi.org/10.23638/lmcs-13(3:7)2017","title":"Algebraic and logical descriptions of generalized trees","display_name":"Algebraic and logical descriptions of generalized trees","publication_year":2017,"publication_date":"2017-07-28","ids":{"openalex":"https://openalex.org/W2528622498","doi":"https://doi.org/10.23638/lmcs-13(3:7)2017","mag":"2528622498"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-13(3:7)2017","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-13(3:7)2017","pdf_url":"https://lmcs.episciences.org/3817/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/3817/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029244225","display_name":"Bruno Courcelle","orcid":"https://orcid.org/0000-0002-5545-8970"},"institutions":[{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Bruno Courcelle","raw_affiliation_strings":["Laboratoire Bordelais de Recherche en Informatique"],"affiliations":[{"raw_affiliation_string":"Laboratoire Bordelais de Recherche en Informatique","institution_ids":["https://openalex.org/I4210142254"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5029244225"],"corresponding_institution_ids":["https://openalex.org/I4210142254"],"apc_list":null,"apc_paid":null,"fwci":0.4741,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.63922594,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"Volume 13, Issue 3","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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.9994999766349792,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9961000084877014,"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.9933000206947327,"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/countable-set","display_name":"Countable set","score":0.8701058626174927},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8041092157363892},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5895587205886841},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5129866003990173},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48884934186935425},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.46471986174583435},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.45505601167678833},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.4532143473625183},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44341519474983215},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4365392327308655},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12269338965415955}],"concepts":[{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.8701058626174927},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8041092157363892},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5895587205886841},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5129866003990173},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48884934186935425},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46471986174583435},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.45505601167678833},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.4532143473625183},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44341519474983215},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4365392327308655},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12269338965415955},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.23638/lmcs-13(3:7)2017","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-13(3:7)2017","pdf_url":"https://lmcs.episciences.org/3817/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1609.09675","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1609.09675","pdf_url":"https://arxiv.org/pdf/1609.09675","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.1609.09675","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1609.09675","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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"}],"best_oa_location":{"id":"doi:10.23638/lmcs-13(3:7)2017","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-13(3:7)2017","pdf_url":"https://lmcs.episciences.org/3817/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2077798120","display_name":null,"funder_award_id":"ANR-10-IDEX-","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G2667004339","display_name":null,"funder_award_id":"10-IDEX-03-02","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G2668054044","display_name":null,"funder_award_id":"ANR-10-IDEX-03-02","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G471331628","display_name":null,"funder_award_id":"ANR-10-IDEX","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G7240651115","display_name":null,"funder_award_id":"ANR-10","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2528622498.pdf"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W187140616","https://openalex.org/W1561798411","https://openalex.org/W1584451387","https://openalex.org/W1623604111","https://openalex.org/W1991735660","https://openalex.org/W2013725463","https://openalex.org/W2020917861","https://openalex.org/W2061786858","https://openalex.org/W2063951771","https://openalex.org/W2072374415","https://openalex.org/W2105322061","https://openalex.org/W2114915973","https://openalex.org/W2170114629","https://openalex.org/W2200685776"],"related_works":["https://openalex.org/W4299610791","https://openalex.org/W2950866767","https://openalex.org/W1631776469","https://openalex.org/W3106300234","https://openalex.org/W3207604768","https://openalex.org/W3019662020","https://openalex.org/W4281680667","https://openalex.org/W4286900056","https://openalex.org/W1963826769","https://openalex.org/W3134934667"],"abstract_inverted_index":{"Quasi-trees":[0],"generalize":[1,75,135],"trees":[2,77],"in":[3,31],"that":[4,35,74,98,108,122],"the":[5,25,40,44,53,62,84,109,120,124],"unique":[6,125],""path"":[7],"between":[8],"two":[9],"nodes":[10],"may":[11],"be":[12],"infinite":[13,101],"and":[14,134],"have":[15],"any":[16],"countable":[17,29,67,143],"order":[18,82],"type.":[19],"They":[20,57],"are":[21,52,58,118,123],"used":[22],"to":[23,39,60],"define":[24,61,92],"rank-width":[26],"of":[27,43,46,65,86,88,127],"a":[28,33,66,80,136],"graph":[30],"such":[32],"way":[34],"it":[36],"is":[37],"equal":[38],"least":[41],"upper-bound":[42],"rank-widths":[45],"its":[47],"finite":[48],"induced":[49],"subgraphs.":[50],"Join-trees":[51],"corresponding":[54],"directed":[55],"trees.":[56,105],"useful":[59],"modular":[63],"decomposition":[64],"graph.":[68],"We":[69,91,106],"also":[70],"consider":[71],"ordered":[72],"join-trees,":[73],"rooted":[76],"equipped":[78],"with":[79,94],"linear":[81,144],"on":[83],"set":[85],"sons":[87],"each":[89],"node.":[90],"algebras":[93],"finitely":[95],"many":[96],"operations":[97],"generate":[99],"(via":[100],"terms)":[102,117],"these":[103],"generalized":[104],"prove":[107],"associated":[110],"regular":[111,116],"objects":[112],"(those":[113],"defined":[114],"by":[115,139],"exactly":[119],"ones":[121],"models":[126],"monadic":[128],"second-order":[129],"sentences.":[130],"These":[131],"results":[132],"use":[133],"similar":[137],"result":[138],"W.":[140],"Thomas":[141],"for":[142],"orders.":[145]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2026-04-23T09:07:50.710637","created_date":"2025-10-10T00:00:00"}