{"id":"https://openalex.org/W2189337051","doi":"https://doi.org/10.1145/3127401","title":"Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars","display_name":"Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars","publication_year":2017,"publication_date":"2017-09-21","ids":{"openalex":"https://openalex.org/W2189337051","doi":"https://doi.org/10.1145/3127401","mag":"2189337051"},"language":"en","primary_location":{"id":"doi:10.1145/3127401","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3127401","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","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/A5036624769","display_name":"Sebastian Eberhard","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Sebastian Eberhard","raw_affiliation_strings":["TU Wien, Wien, Austria"],"affiliations":[{"raw_affiliation_string":"TU Wien, Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015553858","display_name":"Gabriel Ebner","orcid":"https://orcid.org/0000-0003-4057-9574"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Gabriel Ebner","raw_affiliation_strings":["TU Wien, Wien, Austria"],"affiliations":[{"raw_affiliation_string":"TU Wien, Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058192101","display_name":"Stefan Hetzl","orcid":"https://orcid.org/0000-0002-6461-5982"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Stefan Hetzl","raw_affiliation_strings":["TU Wien, Wien, Austria"],"affiliations":[{"raw_affiliation_string":"TU Wien, Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5036624769"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":0.7801,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.77984232,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"18","issue":"4","first_page":"1","last_page":"20"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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.9987000226974487,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9975000023841858,"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/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.7144416570663452},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.6745795011520386},{"id":"https://openalex.org/keywords/regular-tree-grammar","display_name":"Regular tree grammar","score":0.6322371363639832},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5082056522369385},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.49918055534362793},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49663716554641724},{"id":"https://openalex.org/keywords/indexed-grammar","display_name":"Indexed grammar","score":0.4922234117984772},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4920162856578827},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.4810071885585785},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45923882722854614},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4277162551879883},{"id":"https://openalex.org/keywords/context-sensitive-grammar","display_name":"Context-sensitive grammar","score":0.4247218668460846},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3898865580558777},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36023229360580444},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.21963894367218018},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2040202021598816},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.2018178403377533},{"id":"https://openalex.org/keywords/mildly-context-sensitive-grammar-formalism","display_name":"Mildly context-sensitive grammar formalism","score":0.18858963251113892},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16805925965309143},{"id":"https://openalex.org/keywords/phrase-structure-rules","display_name":"Phrase structure rules","score":0.07459267973899841}],"concepts":[{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.7144416570663452},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.6745795011520386},{"id":"https://openalex.org/C57097763","wikidata":"https://www.wikidata.org/wiki/Q7309622","display_name":"Regular tree grammar","level":5,"score":0.6322371363639832},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5082056522369385},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.49918055534362793},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49663716554641724},{"id":"https://openalex.org/C79243999","wikidata":"https://www.wikidata.org/wiki/Q6590011","display_name":"Indexed grammar","level":5,"score":0.4922234117984772},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4920162856578827},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.4810071885585785},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45923882722854614},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4277162551879883},{"id":"https://openalex.org/C125950753","wikidata":"https://www.wikidata.org/wiki/Q908674","display_name":"Context-sensitive grammar","level":4,"score":0.4247218668460846},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3898865580558777},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36023229360580444},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21963894367218018},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2040202021598816},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.2018178403377533},{"id":"https://openalex.org/C172265290","wikidata":"https://www.wikidata.org/wiki/Q6134957","display_name":"Mildly context-sensitive grammar formalism","level":4,"score":0.18858963251113892},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16805925965309143},{"id":"https://openalex.org/C80877019","wikidata":"https://www.wikidata.org/wiki/Q7188074","display_name":"Phrase structure rules","level":3,"score":0.07459267973899841},{"id":"https://openalex.org/C39890363","wikidata":"https://www.wikidata.org/wiki/Q36108","display_name":"Generative grammar","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3127401","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3127401","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","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":46,"referenced_works":["https://openalex.org/W14789509","https://openalex.org/W46221892","https://openalex.org/W153078869","https://openalex.org/W955677872","https://openalex.org/W1500096942","https://openalex.org/W1524741427","https://openalex.org/W1531103278","https://openalex.org/W1569963244","https://openalex.org/W1593799327","https://openalex.org/W1599548286","https://openalex.org/W1659517711","https://openalex.org/W1889418786","https://openalex.org/W1911287697","https://openalex.org/W1927487601","https://openalex.org/W1976149088","https://openalex.org/W1992195988","https://openalex.org/W1999259832","https://openalex.org/W2005910911","https://openalex.org/W2006510146","https://openalex.org/W2006984385","https://openalex.org/W2010270097","https://openalex.org/W2012732732","https://openalex.org/W2022126655","https://openalex.org/W2023738367","https://openalex.org/W2030356709","https://openalex.org/W2037872771","https://openalex.org/W2041211107","https://openalex.org/W2052653988","https://openalex.org/W2086147752","https://openalex.org/W2094342038","https://openalex.org/W2105686649","https://openalex.org/W2111762594","https://openalex.org/W2113711982","https://openalex.org/W2124370744","https://openalex.org/W2130956967","https://openalex.org/W2133527541","https://openalex.org/W2148506544","https://openalex.org/W2185680923","https://openalex.org/W2204729546","https://openalex.org/W2395737562","https://openalex.org/W2505251503","https://openalex.org/W2751273904","https://openalex.org/W2790318756","https://openalex.org/W2906926620","https://openalex.org/W3003570873","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W59084530","https://openalex.org/W1967762699","https://openalex.org/W1557335907","https://openalex.org/W2512382615","https://openalex.org/W2141471933","https://openalex.org/W2055334547","https://openalex.org/W1879113817","https://openalex.org/W2396973697","https://openalex.org/W1991706120","https://openalex.org/W1983513381"],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2],"algorithm":[3,46,84],"to":[4,28,53,62,73],"optimally":[5],"compress":[6],"a":[7,13,25,50,69,88],"finite":[8],"set":[9],"of":[10,22,67,82],"terms":[11],"using":[12],"vectorial":[14,74],"totally":[15,75],"rigid":[16,76],"acyclic":[17,77],"tree":[18,78],"grammar.":[19],"This":[20],"class":[21],"grammars":[23],"has":[24,40],"tight":[26],"connection":[27],"proof":[29],"theory,":[30],"and":[31],"the":[32,54],"grammar":[33],"compression":[34],"problem":[35],"considered":[36],"in":[37,42],"this":[38,64,83],"article":[39],"applications":[41],"automated":[43],"deduction.":[44],"The":[45,58],"is":[47],"based":[48],"on":[49,87],"polynomial-time":[51],"reduction":[52,65],"MaxSAT":[55],"optimization":[56],"problem.":[57],"crucial":[59],"step":[60],"necessary":[61],"justify":[63],"consists":[66],"applying":[68],"term":[70],"rewriting":[71],"relation":[72],"grammars.":[79],"Our":[80],"implementation":[81],"performs":[85],"well":[86],"large":[89],"real-world":[90],"dataset.":[91]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}