The finiteness of synchronous, tabled picture languages is decidable (Q860893)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The finiteness of synchronous, tabled picture languages is decidable |
scientific article |
Statements
The finiteness of synchronous, tabled picture languages is decidable (English)
0 references
9 January 2007
0 references
chain code picture systems
0 references
Lindenmayer systems
0 references
finiteness
0 references
decidability
0 references
