The finiteness of synchronous, tabled picture languages is decidable (Q860893)
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 5083531
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The finiteness of synchronous, tabled picture languages is decidable |
scientific article; zbMATH DE number 5083531 |
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
0 references
0.8505688
0 references
0.8446606
0 references
0.83481324
0 references
0.8334134
0 references
0.82997674
0 references
