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.

Keywords Rectangular Space Filling Curve, finite strings, Context Free Grammar, Amendable Automaton share.