DocumentCode
1191121
Title
R68-27 Programming Languages for Automata
Author
Aho, A.V.
Issue
6
fYear
1968
fDate
6/1/1968 12:00:00 AM
Firstpage
606
Lastpage
606
Abstract
Broadly speaking, an automaton can be considered to be an abstract device consisting of an input tape, a finite state control, and some type of auxiliary memory. Automata have been classified according to the structure of the auxiliary memory and the manner in which information can be stored and retrieved from this memory.
Keywords
Automata; Automatic control; Computational modeling; Computer languages; Information retrieval; Microscopy; Particle measurements; Power measurement; Time measurement; Turing machines;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1968.227427
Filename
1687408
Link To Document