SYSTOLIC PYRAMID AUTOMATA, CELLULAR AUTOMATA AND ARRAY LANGUAGES
Kamala Krithivasan, Meena Mahajan · International Journal of Pattern Recognition and Artificial Intelligence · 1989
Systolic pyramid automata accepting square arrays are defined. Homogeneous and semi-homogeneous pyramid automata are shown to have equal power though regular pyramid automata are more powerful. Languages accepted by these automata are compared with languages generated by array grammars and languages accepted by one-way 2-D cellular automata. Hexagonal pyramid automata are also considered and are shown to accept some languages generated by hexagonal array grammars.