{"id":"https://openalex.org/W2231192532","doi":"https://doi.org/10.2168/lmcs-12(2:3)2016","title":"FO2(<,+1,~) on data trees, data tree automata and branching vector addition systems","display_name":"FO2(<,+1,~) on data trees, data tree automata and branching vector addition systems","publication_year":2016,"publication_date":"2016-04-26","ids":{"openalex":"https://openalex.org/W2231192532","doi":"https://doi.org/10.2168/lmcs-12(2:3)2016","mag":"2231192532"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-12(2:3)2016","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-12(2:3)2016","pdf_url":"https://lmcs.episciences.org/1635/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":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/1635/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Florent Jacquemard","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Florent Jacquemard","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Luc Segoufin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Luc Segoufin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Jer\u00e9mie Dimino","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jer\u00e9mie Dimino","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3045,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.81588996,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"Volume 12, Issue 2","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.3181999921798706,"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/T10142","display_name":"Formal Methods in Verification","score":0.3181999921798706,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.2678999900817871,"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"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.1826000064611435,"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/satisfiability","display_name":"Satisfiability","score":0.5720999836921692},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5142999887466431},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.5020999908447266},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.4832000136375427},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.4327999949455261},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.41929998993873596},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.37369999289512634},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.3538999855518341},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.3449999988079071}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5720999836921692},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5142999887466431},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5034000277519226},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.5020999908447266},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4839000105857849},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.4832000136375427},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.4327999949455261},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4239000082015991},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.41929998993873596},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38530001044273376},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.37369999289512634},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.3538999855518341},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.3449999988079071},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.33709999918937683},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.3248000144958496},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3215999901294708},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.3188999891281128},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3133000135421753},{"id":"https://openalex.org/C65180967","wikidata":"https://www.wikidata.org/wiki/Q130901","display_name":"Binary relation","level":2,"score":0.3107999861240387},{"id":"https://openalex.org/C100481476","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"First-order logic","level":2,"score":0.2913999855518341},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.2847999930381775},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.28360000252723694},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.28189998865127563},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.27709999680519104},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.2671999931335449},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.2637999951839447},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.2549999952316284},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.2526000142097473},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.25110000371932983}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.2168/lmcs-12(2:3)2016","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-12(2:3)2016","pdf_url":"https://lmcs.episciences.org/1635/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:1601.01579","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1601.01579","pdf_url":"https://arxiv.org/pdf/1601.01579","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"pmh:oai:HAL:hal-00769249v3","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-00769249","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, 2016, 12 (2), pp.32. ⟨10.2168/LMCS-12(2:3)2016⟩","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:doaj.org/article:59c5c32ad73e47e88250988adc5d5331","is_oa":true,"landing_page_url":"https://doaj.org/article/59c5c32ad73e47e88250988adc5d5331","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 12, Issue 2 (2016)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-12(2:3)2016","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-12(2:3)2016","pdf_url":"https://lmcs.episciences.org/1635/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":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2231192532.pdf","grobid_xml":"https://content.openalex.org/works/W2231192532.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0],"data":[1,35,65],"tree":[2,7,100],"is":[3,60,75,93],"an":[4,69],"unranked":[5],"ordered":[6],"where":[8],"each":[9],"node":[10],"carries":[11],"a":[12,15,19,61,96],"label":[13],"from":[14,21],"finite":[16],"alphabet":[17],"and":[18,43,54,86,131],"datum":[20],"some":[22],"infinite":[23],"domain.":[24],"We":[25,67,119],"consider":[26],"the":[27,41,44,52],"two":[28],"variable":[29],"first":[30],"order":[31],"logic":[32],"FO2(<,+1,~)":[33,79,89,130],"over":[34],"trees.":[36],"Here":[37],"+1":[38],"refers":[39,50],"to":[40,51],"child":[42],"next":[45],"sibling":[46,56],"relations":[47],"while":[48],"<":[49],"descendant":[53],"following":[55],"relations.":[57],"Moreover,":[58],"~":[59],"binary":[62],"predicate":[63],"testing":[64],"equality.":[66],"exhibit":[68],"automata":[70],"model,":[71],"denoted":[72,102],"DAD#":[73,85,134],"that":[74,82,104],"more":[76],"expressive":[77],"than":[78],"but":[80],"such":[81],"emptiness":[83,132],"of":[84,88,98,129,133],"satisfiability":[87,128],"are":[90,135],"inter-reducible.":[91],"This":[92],"proved":[94],"via":[95],"model":[97],"counter":[99],"automata,":[101],"EBVASS,":[103,127],"extends":[105],"Branching":[106],"Vector":[107],"Addition":[108],"Systems":[109],"with":[110,113],"States":[111],"(BVASS)":[112],"extra":[114],"features":[115],"for":[116,126],"merging":[117],"counters.":[118],"show":[120],"that,":[121],"as":[122],"decision":[123],"problems,":[124],"reachability":[125],"equivalent.":[136]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2016-06-24T00:00:00"}