Capabilities of Automata upon Traversing a Plane

The article examines the traversal of a two-dimensional square grid by finite systems of automata equipped with counters, stacks, and so forth. The author determines which types of systems can traverse the entire grid, and which cannot. The characteristics of those regions of the grid that can be traversed by systems not capable of traversing the entire grid are obtained.