Counting simple rules in semi-conditional grammars is not simple

DOI10.1007/978-3-031-64309-5_16MaRDI QIDQ7030905zbMATH OpenFDO

Authors Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman

Publication date 7 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-64309-5_16

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites work

• A note on the descriptional complexity of semi-conditional grammars
• A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions
• A variant of random context grammars: Semi-conditional grammars
• Descriptional complexity of semi-conditional grammars
• scientific article; zbMATH DE number 709441 (Why is no real title available?)
• scientific article; zbMATH DE number 1870506 (Why is no real title available?)
• Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars
• Improved descriptional complexity results on generalized forbidding grammars
• New nonterminal complexity results for semi-conditional grammars
• Normal forms for phrase-structure grammars
• On the descriptional complexity of some rewriting mechanisms regulated by context conditions
• Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars
• Some restrictive devices for context-free grammars

Cited in

(1)

• Non-simple rule counting in semi-conditional grammars

This page was built for publication: Counting simple rules in semi-conditional grammars is not simple

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