Unconditional transfer in regulated rewriting
From MaRDI portal
Recommendations
Cited in
(5)- Nonterminal complexity of programmed grammars.
- Hybrid modes in cooperating distributed grammar systems: Combining the \(t\)-mode with the modes \(\leqslant k\) and \(=k\)
- scientific article; zbMATH DE number 1114043 (Why is no real title available?)
- Matrix forbidding grammars
- Parsimonious computational completeness
This page was built for publication: Unconditional transfer in regulated rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1374783)