On the computational completeness of generalized forbidding matrix grammars (Q6496878)
From MaRDI portal
scientific article; zbMATH DE number 7842525
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational completeness of generalized forbidding matrix grammars |
scientific article; zbMATH DE number 7842525 |
Statements
On the computational completeness of generalized forbidding matrix grammars (English)
0 references
6 May 2024
0 references
generalized forbidding grammars
0 references
matrix grammars
0 references
computational completeness
0 references
descriptional complexity
0 references
