DocumentCode
1341103
Title
Characterizing Experiments for Finite-Memory Binary Automata
Author
Gill, Arthur
Author_Institution
Dept. of Electrical Engineering, University of California, Berkeley Calif.
Issue
4
fYear
1960
Firstpage
469
Lastpage
471
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;
fLanguage
English
Journal_Title
Electronic Computers, IRE Transactions on
Publisher
ieee
ISSN
0367-9950
Type
jour
DOI
10.1109/TEC.1960.5219887
Filename
5219887
Link To Document