Grammatical complexity for two-dimensional maps
Ryouichi Hagiwara, Akira Shudo · Journal of Physics A Mathematical and General · 2004
We calculate the grammatical complexity of the symbol sequences generated from the Hénon map and the Lozi map using the recently developed methods to construct the pruning front. When the map is hyperbolic, the language of symbol sequences is regular in the sense of the Chomsky hierarchy and the corresponding grammatical complexity takes finite values. It is found that the complexity exhibits a self-similar structure as a function of the system parameter, and the similarity of the pruning fronts is discussed as an origin of such self-similarity. For non-hyperbolic cases, it is observed that the complexity monotonically increases as we increase the resolution of the pruning front.