Characterizing Experiments for Finite-Memory Binary Automata

1 December 1960

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronic Computers

Vol. EC-9 (4) , 469-471
https://doi.org/10.1109/TEC.1960.5219887

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
UPPER BOUND
CLOCKS
CONCURRENT COMPUTING
SAMPLING METHODS
TESTING
CONTRACTS
TRANSDUCERS
CIRCUIT THEORY
YTTRIUM

This publication has 2 references indexed in Scilit:

A Note on Memory Aspects of Sequence Transducers
IRE Transactions on Circuit Theory, 1959
The Theory of Nets
IEEE Transactions on Electronic Computers, 1957