Quantifying distance from simplicity

DOI10.1007/978-3-032-32016-2_4MaRDI QIDQ7412086zbMATH OpenFDO

Authors Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman

Publication date 2027

Full work available at URL https://doi.org/10.1007/978-3-032-32016-2_4

zbMATH Keywords

computational completenessdistance from simplicity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A variant of random context grammars: Semi-conditional grammars
• scientific article; zbMATH DE number 3254902 (Why is no real title available?)
• Non-simple rule counting in semi-conditional grammars
• Normal forms for phrase-structure grammars
• Parameterized and Exact Computation
• Parsimonious computational completeness
• Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars
• Simple-semi-conditional versions of matrix grammars with a reduced regulating mechanism

This page was built for publication: Quantifying distance from simplicity

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