A uniform framework for problems on context-free grammars

MaRDI QIDQ2729233zbMATH OpenFDO

Authors Javier Esparza, Stefan Schwoon, Peter Rossmanith

Publication date 18 July 2001

Published in Bulletin of the European Association for Theoretical Computer Science EATCS (Search for Journal in Brave)

zbMATH Keywords

context-free grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• An efficient automata approach to some problems on context-free grammars.
• scientific article; zbMATH DE number 1101595
• Normal form algorithms for extended context-free grammars
• scientific article; zbMATH DE number 3932414
• Complexity of uniform membership of context-free tree grammars

Cited in

(13)

• An undecidable problem for context-free grammars
• A-coverings for context free grammars
• A complete refinement procedure for regular separability of context-free languages
• On the existence of generators of a CF-grammar for an arbitrary linear Diophantine system
• Complexity of uniform membership of context-free tree grammars
• scientific article; zbMATH DE number 3932414 (Why is no real title available?)
• scientific article; zbMATH DE number 1101595 (Why is no real title available?)
• scientific article; zbMATH DE number 2182441 (Why is no real title available?)
• scientific article; zbMATH DE number 7453188 (Why is no real title available?)
• The Parikh Property for Weighted Context-Free Grammars
• Automatic evaluation of context-free grammars (system description)
• scientific article; zbMATH DE number 2219896 (Why is no real title available?)
• An efficient automata approach to some problems on context-free grammars.

This page was built for publication: A uniform framework for problems on context-free grammars

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