| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437009 | Theoretical Computer Science | 2006 | 19 Pages |
Abstract
In the present paper, synchronous, tabled chain code picture systems based on Lindenmayer systems (sT0L system) are studied with respect to the finiteness of their picture languages. The finiteness is proved to be decidable. Additionally, a method is given for deciding whether or not an sT0L system generates a finite picture language.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
