Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars
From MaRDI portal
Publication:5158664
DOI10.3233/FI-2021-2056OpenAlexW3191309876MaRDI QIDQ5158664FDOQ5158664
Authors: Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele, Indhumathi Raman 
Publication date: 25 October 2021
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2021-2056
Recommendations
- Descriptional complexity of semi-conditional grammars
- Descriptional complexity of matrix simple semi-conditional grammars
- New nonterminal complexity results for semi-conditional grammars
- Improved descriptional complexity results on generalized forbidding grammars
- Improved descriptional complexity results on generalized forbidding grammars
- scientific article; zbMATH DE number 1355184
- Descriptional complexity of context-free grammar forms
- On the computational completeness of matrix simple semi-conditional grammars
- scientific article; zbMATH DE number 5506908
- Descriptional complexity of three-nonterminal scattered context grammars: an improvement
computational completenesssimple semi-conditional grammarsdescriptional complexity measuresGeffert normal forms
Cites Work
- Normal forms for phrase-structure grammars
- On certain formal properties of grammars
- Two Families of Languages Related to ALGOL
- Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars
- A variant of random context grammars: Semi-conditional grammars
- A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions
- Some restrictive devices for context-free grammars
- On the descriptional complexity of some rewriting mechanisms regulated by context conditions
- Title not available (Why is that?)
- Title not available (Why is that?)
- New nonterminal complexity results for semi-conditional grammars
- Title not available (Why is that?)
- Improved descriptional complexity results on generalized forbidding grammars
- Descriptional complexity of semi-conditional grammars
- A note on the descriptional complexity of semi-conditional grammars
- Minimizing rules and nonterminals in semi-conditional grammars: non-trivial for the simple case
- A note on phrase structure grammars
- On the power of permitting semi-conditional grammars
Cited In (7)
- Improved descriptional complexity results on generalized forbidding grammars
- Title not available (Why is that?)
- Descriptional complexity of matrix simple semi-conditional grammars
- Minimizing rules and nonterminals in semi-conditional grammars: non-trivial for the simple case
- Descriptional complexity of semi-conditional grammars
- New nonterminal complexity results for semi-conditional grammars
- On the descriptional complexity of some rewriting mechanisms regulated by context conditions
This page was built for publication: Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5158664)
