Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars

DOI10.1145/3127401zbMath1407.68251OpenAlexW2189337051MaRDI QIDQ4608715

Stefan Hetzl, Sebastian Eberhard, Gabriel Ebner

Publication date: 22 March 2018

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3127401

zbMATH Keywords

MaxSATgrammar-based compressionfinite tree languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Grammars and rewriting systems (68Q42)

Related Items (3)

On the generation of quantified lemmas ⋮ Anti-unification and the theory of semirings ⋮ Higher-order pattern generalization modulo equational theories

This page was built for publication: Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars