DocumentCode
3262822
Title
Bounded-transient automata
Author
Winograd, S.
fYear
1962
fDate
7-12 Oct. 1962
Firstpage
137
Lastpage
142
Abstract
A bounded-transient finite automaton is an automaton for which a single change of an input will not affect the output "far away." This paper investigates the class of events which bounded-transient automata can compute and shows that this class of events is a generalization of the class of definite events. A method of determining whether or not a finite automaton is bounded-transient is described, and the connection between the results of this paper and Kilmer\´s results is indicated.
Keywords
Automata; Computer networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Switching Circuit Theory and Logical Design, 1962. SWCT 1962. Proceedings of the Third Annual Symposium on
Conference_Location
Chicago, IL, USA
Type
conf
DOI
10.1109/FOCS.1962.3
Filename
5397177
Link To Document