• DocumentCode
    3677420
  • Title

    Finiteness of chain-code picture languages on the triangular grid

  • Author

    Gergely T. Bálint;Benedek Nagy

  • Author_Institution
    Department of Computer Science, Faculty of Informatics, University of Debrecen, Hungary
  • fYear
    2015
  • Firstpage
    310
  • Lastpage
    315
  • Abstract
    Chain-code picture systems are Lindenmayer-systems 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.
  • Keywords
    "Color","Geometry","Signal processing","Image edge detection","Topology","Solids","Informatics"
  • Publisher
    ieee
  • Conference_Titel
    Image and Signal Processing and Analysis (ISPA), 2015 9th International Symposium on
  • ISSN
    1845-5921
  • Type

    conf

  • DOI
    10.1109/ISPA.2015.7306078
  • Filename
    7306078
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3677420