On the Finiteness of Picture Languages of synchronous, simple non-deterministic Chain Code Picture Systems

Article type: Research Article

Authors: Truthe, Bianca

Affiliations: Fakultät für Informatik, Otto-von-Guericke-Universität Magdeburg, PSF 4120, D-39016 Magdeburg; Germany

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.

Keywords: chain code picture systems, Lindenmayer systems

Journal: Fundamenta Informaticae, vol. 56, no. 4, pp. 389-409, 2003