Title :
Characterizing Experiments for Finite-Memory Binary Automata
Author_Institution :
Dept. of Electrical Engineering, University of California, Berkeley Calif.
Abstract :
The characteristics of a discrete automaton with a finite memory can be determined by an experiment of a finite length. This paper discusses the properties of such experiments, and presents methods for their optimal construction. Specific results are given for binary-input automata with the memory ranges 0, 1, 2, 3 and 4.
Keywords :
Automata; Circuit theory; Clocks; Concurrent computing; Contracts; Sampling methods; Testing; Transducers; Upper bound; Yttrium;
Journal_Title :
Electronic Computers, IRE Transactions on
DOI :
10.1109/TEC.1960.5219887
