Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Indistinguishability of finite automata in a stationary observation medium

Indistinguishability of finite automata in a stationary observation medium -- We consider criteria of finiteness of the class of automata indistinguishable by simple experiments of infinite and finite length under the condition that, instead of the input-output sequence generated by an automaton, an experimenter observes this sequence coded by some function (observation medium). Under the same conditions we obtain a criteria of break of the chain of classes of automata indistinguishable by experiments of finite length as the length of the experiments increases. 1. INTRODUCTION One of the classic problems of the theory of automata is the investigation of indistinguishability of automata by means of various experiments [1-3]. In this paper the property of indistinguishability of automata by simple experiments which has not been studied earlier is investigated. In the case considered here the input-output sequence generated by an automaton is hidden from an experimenter by an observation medium and he observes only the code-image of this sequence. The following objects can be considered as the observation medium: (1) a logical scheme such that the investigated automaton is a part of it; (2) a device of preliminary processing of observations, e.g. a signature analyzer [4]; (3) a discrete communication channel with noise [5]. In this paper we http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Discrete Mathematics and Applications de Gruyter

Indistinguishability of finite automata in a stationary observation medium

Loading next page...
 
/lp/de-gruyter/indistinguishability-of-finite-automata-in-a-stationary-observation-yv8CGtAMM6

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
de Gruyter
Copyright
Copyright © 2009 Walter de Gruyter
ISSN
0924-9265
eISSN
1569-3929
DOI
10.1515/dma.1993.3.6.623
Publisher site
See Article on Publisher Site

Abstract

-- We consider criteria of finiteness of the class of automata indistinguishable by simple experiments of infinite and finite length under the condition that, instead of the input-output sequence generated by an automaton, an experimenter observes this sequence coded by some function (observation medium). Under the same conditions we obtain a criteria of break of the chain of classes of automata indistinguishable by experiments of finite length as the length of the experiments increases. 1. INTRODUCTION One of the classic problems of the theory of automata is the investigation of indistinguishability of automata by means of various experiments [1-3]. In this paper the property of indistinguishability of automata by simple experiments which has not been studied earlier is investigated. In the case considered here the input-output sequence generated by an automaton is hidden from an experimenter by an observation medium and he observes only the code-image of this sequence. The following objects can be considered as the observation medium: (1) a logical scheme such that the investigated automaton is a part of it; (2) a device of preliminary processing of observations, e.g. a signature analyzer [4]; (3) a discrete communication channel with noise [5]. In this paper we

Journal

Discrete Mathematics and Applicationsde Gruyter

Published: Jan 1, 1993

There are no references for this article.