Strongly Regular Grammars and Regular Approximation of Context-Free Languages

DOI10.1007/978-3-642-02737-6_16MaRDI QIDQ3637226zbMATH OpenOpenAlexFDO

Authors Ömer Eğecioğlu

Publication date 7 July 2009

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02737-6_16

Mathematics Subject Classification ID

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

Recommendations

• Regular approximation of context-free grammars through transformation
• Regular approximation of CFLs: A grammatical view
• 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

Cites work

• scientific article; zbMATH DE number 3173216 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 1962766 (Why is no real title available?)
• scientific article; zbMATH DE number 1502108 (Why is no real title available?)
• Partial algorithm problems for context free languages

Cited in

(8)

• A new algorithm for regularizing one-letter context-free grammars.
• Self-embedded context-free grammars with regular counterparts
• Regular approximation of context-free grammars through transformation
• Regular approximation of CFLs: A grammatical view
• Regular Approximation of Weighted Linear Context-Free Tree Languages
• scientific article; zbMATH DE number 7444007 (Why is no real title available?)
• APPROXIMATING DEPENDENCY GRAMMARS THROUGH INTERSECTION OF STAR-FREE REGULAR LANGUAGES
• Workspace theorems for regular-controlled grammars

This page was built for publication: Strongly Regular Grammars and Regular Approximation of Context-Free Languages

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