On the computational completeness of matrix simple semi-conditional grammars
From MaRDI portal
Publication:2113382
DOI10.1016/J.IC.2021.104688OpenAlexW3118996768MaRDI QIDQ2113382FDOQ2113382
Indhumathi Raman, Lakshmanan Kuppusamy, Henning Fernau
Publication date: 14 March 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2021.104688
Cites Work
- Normal forms for phrase-structure grammars
- Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars
- A variant of random context grammars: Semi-conditional grammars
- On Erasing Productions in Random Context Grammars
- Nonterminal complexity of programmed 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?)
- From regulated rewriting to computing with membranes: collapsing hierarchies
- Programmed Grammars and Classes of Formal Languages
- Petri net algorithms in the theory of matrix grammars
- New nonterminal complexity results for semi-conditional grammars
- Title not available (Why is that?)
- Title not available (Why is that?)
- Descriptional complexity of matrix simple semi-conditional grammars
- A note on the descriptional complexity of semi-conditional grammars
- Title not available (Why is that?)
- On the power of permitting semi-conditional grammars
- Simple-semi-conditional versions of matrix grammars with a reduced regulating mechanism
Cited In (5)
This page was built for publication: On the computational completeness of matrix simple semi-conditional grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113382)
