Semi-conditional matrix grammars with as few as three nonterminals, or with small degrees and short matrices, are computationally complete for the class of recursively enumerable languages.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On Computational Completeness of Semi-Conditional Matrix Grammars
Semi-conditional matrix grammars with as few as three nonterminals, or with small degrees and short matrices, are computationally complete for the class of recursively enumerable languages.