Syntax directed compression of trees using pushdown automata

DOI10.1142/9789814271059_0019MaRDI QIDQ4907872zbMATH OpenOpenAlexFDO

Authors Priti Shankar

Publication date 26 February 2013

Published in Modern Applications of Automata Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/9789814271059_0019

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Formal languages and automata (68Q45)

Recommendations

• Tree compression pushdown automaton
• Pushdown compression
• Implementation and Application of Automata
• TREE COMPRESSION AND OPTIMIZATION WITH APPLICATIONS

Cited in

(9)

• Smoothing and compression with stochastic \(k\)-testable tree languages
• Tree compression pushdown automaton
• Parameter reduction and automata evaluation for grammar-compressed trees
• Efficient Statistical Modeling for the Compression of Tree Structured Intermediate Code
• Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars
• Pushdown compression
• Leaf languages and string compression
• Implementation and Application of Automata
• The complexity of tree automata and XPath on grammar-compressed trees

This page was built for publication: Syntax directed compression of trees using pushdown automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4907872)