Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice

DOI10.1007/11812128_10MaRDI QIDQ5757217zbMATH OpenOpenAlexFDO

Authors Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter

Publication date 6 September 2007

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11812128_10

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• REDUCING SIMPLE GRAMMARS: EXPONENTIAL AGAINST HIGHLY-POLYNOMIAL TIME IN PRACTICE
• String Processing and Information Retrieval
• Approximation of grammar-based compression via recompression
• Approximation of Grammar-Based Compression via Recompression
• Parameter reduction and automata evaluation for grammar-compressed trees

Cited in

(4)

• Parameter-reduction of higher level grammars
• Grammar flow analysis reduction to scheduling problem
• scientific article; zbMATH DE number 4155910 (Why is no real title available?)
• REDUCING SIMPLE GRAMMARS: EXPONENTIAL AGAINST HIGHLY-POLYNOMIAL TIME IN PRACTICE

This page was built for publication: Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice

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