Six nonterminals are enough for generating each r.e. language by a matrix grammar (Q3347322): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/00207168408803399 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W112931193 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4122828 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Programmed Grammars and Classes of Formal Languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the effect of the finite index restriction on several families of grammars / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 16:02, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Six nonterminals are enough for generating each r.e. language by a matrix grammar |
scientific article |
Statements
Six nonterminals are enough for generating each r.e. language by a matrix grammar (English)
0 references
1984
0 references
recursively enumerable language
0 references
context-free matrix grammar
0 references
appearance checking
0 references
programmed grammar
0 references
linear language
0 references
regular languages
0 references
