Finiteness of Chain-code Picture Languages on the Triangular Grid

Simple item page
dc.contributor.authorBalint, Gergely T.
dc.contributor.authorNagy, Benedek
dc.date.accessioned2026-02-06T18:28:36Z
dc.date.issued2015
dc.departmentDoğu Akdeniz Üniversitesi
dc.description9th International Symposium on Image and Signal Processing and Analysis (ISPA) -- SEP 07-09, 2015 -- Zagreb, CROATIA
dc.description.abstractChain-code picture systems are Lindenmayersystems over special alphabets. The generated words are interpreted as chain-code pictures containing vertices and edges of the regular triangular grid. The finiteness of various chain-code picture languages are investigated based on properties of length-contracting, length-constant and length-expanding sD0L parallel rewriting systems. The case of shuffled axioms is also explored.
dc.description.sponsorshipUniv Zagreb, Fac Elect Engn & Comp,IEEE Signal Proc Soc
dc.identifier.endpage315
dc.identifier.isbn978-1-4673-8032-4
dc.identifier.issn1845-5921
dc.identifier.scopus2-s2.0-84964040362
dc.identifier.scopusqualityQ3
dc.identifier.startpage310
dc.identifier.urihttps://hdl.handle.net/11129/11024
dc.identifier.wosWOS:000378419400056
dc.identifier.wosqualityN/A
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherIEEE
dc.relation.ispartofIspa 2015 9Th International Symposium on Image and Signal Processing and Analysis
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WoS_20260204
dc.titleFiniteness of Chain-code Picture Languages on the Triangular Grid
dc.typeConference Object

Files

Collections

WoS Indexed Publications Collection
Scopus İndeksli Yayınlar Koleksiyonu