A Method for Deciding the Finiteness of Deterministic Tabled Picture Languages

摘要

Chain code picture systems based on LINDENMAYER systems can be used to generate pictures. In this paper, synchronous, deterministic tabled chain code picture systems (sDT0L systems) and their picture languages are considered. A method is given for deciding whether an sDT0L system generates a finite picture language or not. This proves that the finiteness of picture languages of sDT0L systems is decidable.