R68-27 Programming Languages for Automata

Alfred V. Aho · IEEE Transactions on Computers · 1968

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.

Read the paper · More papers on PaperTik