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

Learn More →

Reconstruction of sequential machines by experiments

Reconstruction of sequential machines by experiments -- The reconstruction of a finite state machine on the basis of experiments performed on it is discussed. The concept of irredundancy is introduced and the respective criterion is found for the machine that accepts a given set of experiments. A separate treatment is given to the case when such a machine is unique. The respective criterion is presented. 1. INTRODUCTION The present article treats the finite state machine as a processor of input-output sequences (words) which can be associated by an experiment [1]. Experimental results constitute the information available to the researcher analyzing the input-output behaviour of the machine. The problem is thus to reconstruct the machine by the experimental findings. It was originally formulated by Moore [2] and extended by other workers [3-5]. An important aspect of the problem is to reconstruct a machine that would be irredundant in a certain sense. This problem has been reiterated by the aforementioned authors. We approach the description of irredundant state machines on the assumption that the initial set of experiments is finite and the concept of irredundancy is defined as follows: an irredundant machine has no parts of its own that would recognize the initial set of experiments. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Discrete Mathematics and Applications de Gruyter

Reconstruction of sequential machines by experiments

Loading next page...
 
/lp/de-gruyter/reconstruction-of-sequential-machines-by-experiments-vbhz7chs0p

References (6)

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

Abstract

-- The reconstruction of a finite state machine on the basis of experiments performed on it is discussed. The concept of irredundancy is introduced and the respective criterion is found for the machine that accepts a given set of experiments. A separate treatment is given to the case when such a machine is unique. The respective criterion is presented. 1. INTRODUCTION The present article treats the finite state machine as a processor of input-output sequences (words) which can be associated by an experiment [1]. Experimental results constitute the information available to the researcher analyzing the input-output behaviour of the machine. The problem is thus to reconstruct the machine by the experimental findings. It was originally formulated by Moore [2] and extended by other workers [3-5]. An important aspect of the problem is to reconstruct a machine that would be irredundant in a certain sense. This problem has been reiterated by the aforementioned authors. We approach the description of irredundant state machines on the assumption that the initial set of experiments is finite and the concept of irredundancy is defined as follows: an irredundant machine has no parts of its own that would recognize the initial set of experiments.

Journal

Discrete Mathematics and Applicationsde Gruyter

Published: Jan 1, 1991

There are no references for this article.