An analysis of errors in finite automata*

https://doi.org/10.1016/S0019-9958(65)90223-8Get rights and content
Under an Elsevier user license
open archive

This paper studies errors in finite automata. An error is defined as a pair of states and errors are then classified according to their probability of being corrected (i.e., being taken into the same state). Various results are then given on the partitioning properties of a particular type of error called a finite error.

Cited by (0)

*

This work was supported in part by Air Force Contract AF 30(602)-3546. Section IV represents work done while the author was associated with the General Electric Research Laboratory, Schenectady, New York.

Copyright © 1965 Published by Elsevier Inc.