{"id":"https://openalex.org/W4399807296","doi":"https://doi.org/10.3390/a17060268","title":"Parsing Unranked Tree Languages, Folded Once","display_name":"Parsing Unranked Tree Languages, Folded Once","publication_year":2024,"publication_date":"2024-06-19","ids":{"openalex":"https://openalex.org/W4399807296","doi":"https://doi.org/10.3390/a17060268"},"language":"en","primary_location":{"id":"doi:10.3390/a17060268","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a17060268","pdf_url":"https://www.mdpi.com/1999-4893/17/6/268/pdf?version=1718787756","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/17/6/268/pdf?version=1718787756","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028862129","display_name":"Martin Berglund","orcid":"https://orcid.org/0000-0002-3692-6994"},"institutions":[{"id":"https://openalex.org/I90267481","display_name":"Ume\u00e5 University","ror":"https://ror.org/05kb8h459","country_code":"SE","type":"education","lineage":["https://openalex.org/I90267481"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Martin Berglund","raw_affiliation_strings":["Deptartment of Computing Science, Ume\u00e5 University, 90836 Ume\u00e5, Sweden"],"raw_orcid":"https://orcid.org/0000-0002-3692-6994","affiliations":[{"raw_affiliation_string":"Deptartment of Computing Science, Ume\u00e5 University, 90836 Ume\u00e5, Sweden","institution_ids":["https://openalex.org/I90267481"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101796946","display_name":"Henrik Bj\u00f6rklund","orcid":"https://orcid.org/0000-0002-4696-9787"},"institutions":[{"id":"https://openalex.org/I90267481","display_name":"Ume\u00e5 University","ror":"https://ror.org/05kb8h459","country_code":"SE","type":"education","lineage":["https://openalex.org/I90267481"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Henrik Bj\u00f6rklund","raw_affiliation_strings":["Deptartment of Computing Science, Ume\u00e5 University, 90836 Ume\u00e5, Sweden"],"raw_orcid":"https://orcid.org/0000-0002-4696-9787","affiliations":[{"raw_affiliation_string":"Deptartment of Computing Science, Ume\u00e5 University, 90836 Ume\u00e5, Sweden","institution_ids":["https://openalex.org/I90267481"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026629742","display_name":"Johanna Bj\u00f6rklund","orcid":"https://orcid.org/0000-0003-0596-627X"},"institutions":[{"id":"https://openalex.org/I90267481","display_name":"Ume\u00e5 University","ror":"https://ror.org/05kb8h459","country_code":"SE","type":"education","lineage":["https://openalex.org/I90267481"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Johanna Bj\u00f6rklund","raw_affiliation_strings":["Deptartment of Computing Science, Ume\u00e5 University, 90836 Ume\u00e5, Sweden"],"raw_orcid":"https://orcid.org/0000-0003-0596-627X","affiliations":[{"raw_affiliation_string":"Deptartment of Computing Science, Ume\u00e5 University, 90836 Ume\u00e5, Sweden","institution_ids":["https://openalex.org/I90267481"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5026629742","https://openalex.org/A5028862129"],"corresponding_institution_ids":["https://openalex.org/I90267481"],"apc_list":{"value":1600,"currency":"CHF","value_usd":1930},"apc_paid":{"value":1600,"currency":"CHF","value_usd":1930},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09414825,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":"6","first_page":"268","last_page":"268"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9995999932289124,"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/T11567","display_name":"semigroups and automata theory","score":0.9995999932289124,"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.994700014591217,"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/T10142","display_name":"Formal Methods in Verification","score":0.9923999905586243,"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/parsing","display_name":"Parsing","score":0.6634949445724487},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6371458768844604},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.6231997609138489},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6131888031959534},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5580553412437439},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5355790257453918},{"id":"https://openalex.org/keywords/folding","display_name":"Folding (DSP implementation)","score":0.45143774151802063},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39291131496429443},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37981700897216797},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37340134382247925},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3060484528541565},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21250098943710327}],"concepts":[{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.6634949445724487},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6371458768844604},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.6231997609138489},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6131888031959534},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5580553412437439},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5355790257453918},{"id":"https://openalex.org/C2776545253","wikidata":"https://www.wikidata.org/wiki/Q5464292","display_name":"Folding (DSP implementation)","level":2,"score":0.45143774151802063},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39291131496429443},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37981700897216797},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37340134382247925},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3060484528541565},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21250098943710327},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a17060268","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a17060268","pdf_url":"https://www.mdpi.com/1999-4893/17/6/268/pdf?version=1718787756","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:DiVA.org:umu-227569","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-227569","pdf_url":null,"source":{"id":"https://openalex.org/S4306400361","display_name":"DiVA at Ume\u00e5 University (Ume\u00e5 University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I90267481","host_organization_name":"Ume\u00e5 University","host_organization_lineage":["https://openalex.org/I90267481"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:doaj.org/article:38f4c5e18400400493e452dd290828bf","is_oa":false,"landing_page_url":"https://doaj.org/article/38f4c5e18400400493e452dd290828bf","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 17, Iss 6, p 268 (2024)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/a17060268","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a17060268","pdf_url":"https://www.mdpi.com/1999-4893/17/6/268/pdf?version=1718787756","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2179154197","display_name":"Semantic Parsing of Multimodal Data","funder_award_id":"2020-03852","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"}],"funders":[{"id":"https://openalex.org/F4320322327","display_name":"Knut och Alice Wallenbergs Stiftelse","ror":"https://ror.org/004hzzk67"},{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4399807296.pdf","grobid_xml":"https://content.openalex.org/works/W4399807296.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W1577544661","https://openalex.org/W2083567135","https://openalex.org/W2085550081","https://openalex.org/W2088602194","https://openalex.org/W2106001218","https://openalex.org/W2108239140","https://openalex.org/W2131429178","https://openalex.org/W2148840679","https://openalex.org/W2152163260","https://openalex.org/W2250668036","https://openalex.org/W2251235167","https://openalex.org/W2252123671","https://openalex.org/W2496305328","https://openalex.org/W2616975455","https://openalex.org/W2886598270","https://openalex.org/W2953879692","https://openalex.org/W2955357496","https://openalex.org/W3157598257","https://openalex.org/W3173299608","https://openalex.org/W4285288086","https://openalex.org/W4387849497","https://openalex.org/W6691651091","https://openalex.org/W6779715462"],"related_works":["https://openalex.org/W579810227","https://openalex.org/W2142145894","https://openalex.org/W2952780262","https://openalex.org/W2979495269","https://openalex.org/W2392917763","https://openalex.org/W2358855848","https://openalex.org/W2359307945","https://openalex.org/W4388176285","https://openalex.org/W2083429127","https://openalex.org/W2033808215"],"abstract_inverted_index":{"A":[0],"regular":[1,8],"unranked":[2,9],"tree":[3,10,24],"folding":[4,14],"consists":[5],"of":[6,22,43,62],"a":[7,13,23,27,32,63],"language":[11],"and":[12],"operation":[15,65,102],"that":[16,52],"merges":[17],"(i.e.,":[18],"folds)":[19],"selected":[20],"nodes":[21],"to":[25,68],"form":[26],"graph;":[28],"the":[29,41,45,53,70,77,82,95,106,109,119],"combination":[30],"is":[31,49,55,79,84,103,111,121],"formal":[33],"device":[34],"for":[35],"representing":[36],"graph":[37],"languages.":[38],"If,":[39],"in":[40,86,123],"process":[42],"folding,":[44],"order":[46,78,107],"among":[47,108],"edges":[48,110],"discarded":[50],"so":[51],"result":[54],"an":[56],"unordered":[57],"graph,":[58],"then":[59,81],"two":[60],"applications":[61],"fold":[64,101],"are":[66],"enough":[67],"make":[69],"associated":[71],"parsing":[72],"problem":[73,83,120],"NP-complete.":[74],"However,":[75],"if":[76],"kept,":[80],"solvable":[85,122],"non-uniform":[87,124],"polynomial":[88,125],"time.":[89,126],"In":[90],"this":[91],"paper,":[92],"we":[93],"address":[94],"remaining":[96],"case,":[97],"where":[98],"only":[99],"one":[100],"applied,":[104],"but":[105],"discarded.":[112],"We":[113],"show":[114],"that,":[115],"under":[116],"these":[117],"conditions,":[118]},"counts_by_year":[],"updated_date":"2026-08-22T07:34:49.880490","created_date":"2025-10-10T00:00:00"}