|
Your search for [subject]Sequential machine theory returned 20 records. |
|
|
Sort by:
|
|
|
|
|
|
|
|
Introduction to the theory of finite automata.
by Kobrinskii, N.E.; Amsterdam: North-Holland Pub., 1965.
Subject: Sequential machine theory.
|
|
|
|
|
|
|
|
|
|
|
|
|
Switching and finite automata theory.
by Kohavi, Zvi; New York: McGraw-Hill, 1970.
Subject: Sequential machine theory; Switching theory.
|
|
|
|
|
|
|
|
|
|
|
|
|
An experimental facility for sequential decoding.
by Neissen, C.W.; Cambridge, Mass.: Massachusetts Institute of Technology, 1965.
Subject: Coding theory; Sequential machine theory.
|
|
|
|
|
|
|
|
|
|
|
|
|
Switching and finite automata theory.
by Kohavi, Zvi.; New York: McGraw-Hill, 1978.
Subject: Sequential machine theory; Switching theory.
|
|
|
|
|
|
|
|
|
|
|
|
|
Introduction to languages and the theory of computation.
by Martin, John C.; New York: McGraw-Hill, 1997.
Subject: Sequential machine theory; Computable function.
|
|
|
|
|
|
|
|
|
|
|
|
|
Introduction to languages and the theory of computation.
by Martin, John C.; Boston: McGraw-Hill, 2003.
Subject: Sequential machine theory; Computable functions.
|
|
|
|
|
|
|
|
|
|
|
|
|
Elementary computability, formal languages, and automata.
by McNaughton, Robert; Englewood Cliffs, N.J.: Prentice-Hall, 1982.
Subject: Computable functions; Sequential machine theory.
|
|
|
|
|
|
|
|
|
|
|
|
|
Abstract communication complexity and the uniform computing models.
by Adorna, Henry Natividad, 1967-; 2002.
Subject: Computational complexity; Sequential machine theory; Algebra, Boolean.
|
|
|
|
|
|
|
|
|
|
|
|
|
Digital systems logic and circuits.
by Zacharov, Basil; London: George Allen and Unwin Ltd., 1968.
Subject: Algebra, Boolean; Computers -- Circuits; Sequential machine theory.
|
|
|
|
|
|
|
|
|
|
|
|
|
Computation and automata.
by Salomaa, Arto; Cambridge: Cambridge University Press, 1985.
Subject: Computable functions; Computational complexity; Sequential machine theory.
|
|
|
|
|
|
|
|
|
|
« Previous 1 2 Next » |