On the progress of communication between two finite state machines
Information and Control
Computation: finite and infinite machines
Computation: finite and infinite machines
On the computation power of finite automata in two-dimensional environments
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
| Hi-index | 0.00 |
The paper deals with the problem of indistinguishability of finite-state automata interacting with the same environment. A method of construction of efficient environments, i.e., the environments for which this problem is algorithmically solvable, is proposed. An example of an inefficient geometric environment is given.