Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars
type: Item
instance of: scholarly article
title: Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars
zbMATH Open document ID: 1407.68251
DOI: 10.1145/3127401
author: Sebastian Eberhard
author: Gabriel Ebner
author: Stefan Hetzl
published in: ACM Transactions on Computational Logic
publication date: 2018-03-22T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 6852229
zbMATH Keywords: grammar-based compression
zbMATH Keywords: MaxSAT
zbMATH Keywords: finite tree languages
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1145/3127401
OpenAlex ID: W2189337051
Recommended article: Compressibility of Finite Languages by Grammars
Recommended article: Grammar-Based Tree Compression
Recommended article: Tree compression using string grammars
Recommended article: Syntax Directed Compression of Trees Using Pushdown Automata
Recommended article: Parameter reduction and automata evaluation for grammar-compressed trees
Recommended article: Parameter Reduction in Grammar-Compressed Trees
Recommended article: Q4828933
Recommended article: Grammar-based compression of unranked trees
description: scientific article; zbMATH DE number 6852229