Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars (Q3517098)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5309911
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars |
scientific article; zbMATH DE number 5309911 |
Statements
12 August 2008
0 references
graph-controlled grammars
0 references
programmed grammars
0 references
nonterminal complexity
0 references
appearance checking
0 references
0.8744561672210693
0 references
0.8378888964653015
0 references
0.8317746520042419
0 references
