Indistinguishability of Finite-State Automata with Respect to Some Environments
Author: Kurganskii, A.N.
Source: Cybernetics and Systems Analysis, Volume 37, Number 1, 2 January 2001 , pp. 33-41(9)
Abstract: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.
Document Type: Regular Paper
Affiliations: Institute of Applied Mathematics and Mechanics, National Academy of Sciences of Ukraine, Donetsk, Ukraine
Publication date: January 2, 2001