Skip to main content
Journal Article

A method for deciding the finiteness of deterministic tabled picture languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3340 406-417
DOI: 10.1007/978-3-540-30550-7_34
1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Chain code picture systems based on LlNDENMAYER 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. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Truthe, B. (2004). A method for deciding the finiteness of deterministic tabled picture languages. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3340, 406–417. https://doi.org/10.1007/978-3-540-30550-7_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free