Regular approximation of CFLs: A grammatical view

MaRDI QIDQ2776326zbMATH OpenFDO

Authors Mark-Jan Nederhof

Publication date 28 February 2002

zbMATH Keywords

context-free grammarregular language

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45) Natural language processing (68T50)

Recommendations

• Regular approximation of context-free grammars through transformation
• Strongly Regular Grammars and Regular Approximation of Context-Free Languages
• On the existence of regular approximations
• A new algorithm for regularizing one-letter context-free grammars.
• Regular Approximation of Weighted Linear Context-Free Tree Languages

Cited in

(8)

• On the existence of regular approximations
• A complete refinement procedure for regular separability of context-free languages
• Regular approximation of context-free grammars through transformation
• Regular Approximation of Weighted Linear Nondeleting Context-Free Tree Languages
• Approximation of weighted automata with storage
• Strongly Regular Grammars and Regular Approximation of Context-Free Languages
• scientific article; zbMATH DE number 522861 (Why is no real title available?)
• Regular Approximation of Weighted Linear Context-Free Tree Languages

This page was built for publication: Regular approximation of CFLs: A grammatical view

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