Strongly Regular Grammars and Regular Approximation of Context-Free Languages

DOI10.1007/978-3-642-02737-6_16zbMath1247.68118OpenAlexW2112919324MaRDI QIDQ3637226

Ö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

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

Cites Work

• Partial algorithm problems for context free languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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