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.

Subject Classification:

• 03D05
• 68Q70
• 94A45

Keywords:

• Rectangular Space Filling Curve
• finite strings
• Context Free Grammar
• Amendable Automaton share

Correction Statement

This article has been republished with minor changes. These changes do not impact the academic content of the article.