Abstract
In the present paper, synchronous, simple non-deterministic chain code picture systems based on Lindenmayer systems (sOL systems) 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 an sOL system generates a finite picture language or not.
Get full access to this article
View all access options for this article.