Finiteness of Chain-code Picture Languages on the Triangular Grid
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
IEEE
Access Rights
info:eu-repo/semantics/closedAccess
Abstract
Chain-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.
Description
9th International Symposium on Image and Signal Processing and Analysis (ISPA) -- SEP 07-09, 2015 -- Zagreb, CROATIA
Keywords
Journal or Series
Ispa 2015 9Th International Symposium on Image and Signal Processing and Analysis
