Title
Amendable automaton for the language of finite strings of rectangular hilbert curve
Abstract
Level based Context Free Grammar (CFG) is introduced and is defined to generate the language of finite strings of Rectangular Hilbert Curve. An Amendable automaton equivalent to this Level based CFG is produced to accept the language of these finite strings.
Department(s)
Information Technology and Cybersecurity
Document Type
Article
DOI
https://doi.org/10.1080/09720529.2019.1689611
Keywords
03D05, 68Q70, 94A45, Amendable Automaton share, Context Free Grammar, finite strings, Rectangular Space Filling Curve
Publication Date
8-18-2019
Recommended Citation
Thiagarajan, K., P. Balasubramanian, K. Navaneetham, and S. Brahnam. "Amendable automaton for the language of finite strings of rectangular hilbert curve." Journal of Discrete Mathematical Sciences and Cryptography 22, no. 6 (2019): 1129-1140.
Journal Title
Journal of Discrete Mathematical Sciences and Cryptography