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

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...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerző: Truthe Bianca
Dokumentumtípus: Cikk
Megjelent: 2005
Sorozat:Acta cybernetica 17 No. 1
Kulcsszavak:Számítástechnika, Kibernetika
Tárgyszavak:
Online Access:http://acta.bibl.u-szeged.hu/12753
LEADER 01388nab a2200217 i 4500
001 acta12753
005 20220615130240.0
008 161015s2005 hu o 0|| eng d
022 |a 0324-721X 
040 |a SZTE Egyetemi Kiadványok Repozitórium  |b hun 
041 |a eng 
100 1 |a Truthe Bianca 
245 1 3 |a On the finiteness of picture languages of synchronous deterministic chain code picture systems  |h [elektronikus dokumentum] /  |c  Truthe Bianca 
260 |c 2005 
300 |a 53-73 
490 0 |a Acta cybernetica  |v 17 No. 1 
520 3 |a 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. 
650 4 |a Természettudományok 
650 4 |a Számítás- és információtudomány 
695 |a Számítástechnika, Kibernetika 
856 4 0 |u http://acta.bibl.u-szeged.hu/12753/1/Truthe_2005_ActaCybernetica.pdf  |z Dokumentum-elérés