Minimizing rules and nonterminals in semi-conditional grammars: non-trivial for the simple case

DOI10.1007/978-3-319-92402-1_5OpenAlexW2803908903MaRDI QIDQ1647317

Indhumathi Raman, Rufus O. Oladele, Lakshmanan Kuppusamy, Henning Fernau

Publication date: 26 June 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-92402-1_5

zbMATH Keywords

computational completenesssimple semi-conditional grammarsdescriptional complexity measures

Mathematics Subject Classification ID

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

Related Items (2)

Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars ⋮ Improved descriptional complexity results on generalized forbidding grammars

This page was built for publication: Minimizing rules and nonterminals in semi-conditional grammars: non-trivial for the simple case