Grids of finite automata Karlis Jerins

The concept Finite number of components Each component is a finite automaton minus read head State transitions are performed depending on neighbors’ current states One component is designated as the main component When the main component halts, its last state is transformed into the answer

The results All regular languages can be recognized Components arranged in a single line The grid emulates the minimal 1-DFA Certain context-free languates can be recognized {0n1n} and {w#wrev} Certain context-sensitive languages can be recognized {0n1n2n} and {ww} Components arranged in multiple lines

Future work Set more precise bounds on computational power Investigate the importance of the grid Investigate use of non-deterministic components

Thank you for your attention!