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

Paper

Efficient Heuristics for Orientation Metric and Euclidean Steiner Tree Problems *

Y.Y. Li, K.S. Leung, et al.

J Combin Optim

Conference paper

Time development of AlGaAs single-quantum-well laser facet temperature on route to catastrophical breakdown

W.C. Tang, H. Rosen, et al.

SPIE Optics, Electro-Optics, and Laser Applications in Science and Engineering 1991

Paper

Mapping behavioral specifications to model parameters in synthetic biology

Heinz Koeppl, Marc Hafner, et al.

BMC Bioinformatics

Paper

On the spectral radius of (0,1)-matrices

R.A. Brualdi, A.J. Hoffman

Linear Algebra and Its Applications

View all publications