The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases (Q3633999)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases |
scientific article |
Statements
The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases (English)
0 references
23 June 2009
0 references
two-dimensional languages
0 references
tiling systems
0 references
linearly space-bounded Turing machine
0 references
head reversal-bounded computation
0 references
