Expressiveness and complexity of regular pure two-dimensional context-free languages (Q2855787)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Expressiveness and complexity of regular pure two-dimensional context-free languages |
scientific article; zbMATH DE number 6217966
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Expressiveness and complexity of regular pure two-dimensional context-free languages |
scientific article; zbMATH DE number 6217966 |
Statements
Expressiveness and complexity of regular pure two-dimensional context-free languages (English)
0 references
22 October 2013
0 references
picture languages
0 references
pure grammars
0 references
rectangular arrays
0 references
two-dimensional grammars
0 references
0.8476263284683228
0 references
0.8164986371994019
0 references
0.8083416223526001
0 references
0.78608638048172
0 references
0.784933865070343
0 references
