On the finiteness of picture languages of synchronous deterministic chain code picture systems

Truthe, Bianca: On the finiteness of picture languages of synchronous deterministic chain code picture systems. In: Acta cybernetica, (17) 1. pp. 53-73. (2005)

[img]
Preview
Cikk, tanulmány, mű
Truthe_2005_ActaCybernetica.pdf

Download (228kB) | Preview

Abstract

Chain Code Picture Systems are LINDENMAYER systems over a special alphabet. The strings generated are interpreted as pictures. This leads to Chain Code Picture Languages. In this paper, synchronous deterministic Chain Code Picture Systems (sDOL systems) are studied with respect to the finiteness of their picture languages. First, a hierarchy of abstractions is developed, in which the interpretation of a string as a picture passes through a multilevel process. Second, on the basis of this hierarchy, an algorithm is designed which decides the finiteness or infiniteness of any sDOL system in polynomial time.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2005
Volume: 17
Number: 1
ISSN: 0324-721X
Page Range: pp. 53-73
Language: angol
Uncontrolled Keywords: Természettudomány
Additional Information: Bibliogr.: 73. p.; Abstract
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2018. Jun. 05. 13:47
URI: http://acta.bibl.u-szeged.hu/id/eprint/12753

Actions (login required)

View Item View Item