Nimrod Megiddo
Journal of Symbolic Computation
Paper
A generalization of the theory of incompletely specified machines
Abstract
A generalized theory of incompletely specified machines is described in whichspecification of various alternative outputs is possible for any given input. Also, certain inputs may be prohibited. Algorithms for state reduction are given. © 1972 Academic Press, Inc.
Related
Conference paper
Patterning of highly conducting polyaniline films
T. Graham, A. Afzali, et al.
Microlithography 2000
Robert Manson Sawko, Malgorzata Zimon
SIAM/ASA JUQ
George Markowsky
J. Math. Anal. Appl.