Journal of Computer and System Sciences

Paper

01 Jan 1972

A generalization of the theory of incompletely specified machines

View publication

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

Characterization of line width variation

Alfred K. Wong, Antoinette F. Molless, et al.

SPIE Advanced Lithography 2000

Paper

Classification with nonmetric distances: Image retrieval and class representation

David W. Jacobs, Daphna Weinshall, et al.

IEEE Transactions on Pattern Analysis and Machine Intelligence

Conference paper

Effects of KrF laser radiation on fused-silica glass: a comparison of samples exposed in air vs vacuum

I.K. Pour, D.J. Krajnovich, et al.

SPIE Optical Materials for High Average Power Lasers 1992

Paper

Interactive scheduling as a constraint satisfiability problem

Ronen Feldman, Martin Charles Golumbic

Ann. Math. Artif. Intell.

View all publications