Results 221 to 230 of about 88,286 (263)
Some of the next articles are maybe not open access.
Identification and Minimization of Linear Machines
IEEE Transactions on Electronic Computers, 1965This paper is a study of linear machines and their submachines. Methods are presented for finding the reduced form of a given linear machine with or without fixed initial state. A technique is suggested for detecting whether a machine is linear or can be embedded as a submachine in a linear machine. In the latter case a state assignment is produced for
Martin Cohn, Shimon Even
openaire +1 more source
Decomposition of linear sequential machines
Mathematical Systems Theory, 1969Linear sequential machines can sometimes be decomposed into parallel and series connections of smaller linear sequential machines. Necessary and sufficient conditions are given for such decompositions to exist for finite linear sequential machines.
Hervé Gallaire, Michael A. Harrison
openaire +2 more sources
Optimal quantum machines by linear and non‐linear optics
Fortschritte der Physik, 2004AbstractSince manipulations of qubits are constrained by the quantum mechanical rules, several classical information tasks can not be perfectly extended to the quantum world. The more relevant limitations in quantum information processing are the impossibility to perfectly clone any unknown qubit and to map it in its orthogonal state. Even if these two
SCIARRINO, Fabio, DE MARTINI, Francesco
openaire +3 more sources
A Linear Decomposition for Sequential Machines
IEEE Transactions on Computers, 1970This paper considers the loop-free decomposition of nonautonomous, synchronous, deterministic, nonlinear sequential machines into linear and nonlinear component machines. Two methods are derived which generate the desired decomposition and determine the state code assignment consistent with the linear realization of a component machine.
openaire +2 more sources
Uniform Modular Realizations and Linear Machines
IEEE Transactions on Computers, 1971It is shown that a single-output Moore-type n-state linear machine may be realized with no more than 2n copies of the AND–OR-delay (AOD) module of Newborn, Weiner, and Hopcroft. This bound is significantly lower than that for arbitrary single-output Moore-type machines, which is 2n.
S. Erol Gelenbe, N. Rossi
openaire +1 more source
Linearity Testing and Realization of Sequential Machines
IEEE Transactions on Computers, 1974The necessary and sufficient conditions for the linear realizability of a sequential machine are stated. The discussion considers the state transition and output functions separately and thus machines with nonlinear output function can also be tested for linearity of the state transition function.
A. S. Gupta +2 more
openaire +2 more sources
The Tree Set of a Linear Machine
IEEE Transactions on Electronic Computers, 1965Linear sequential machines are finding an increasing number of uses in error correction, random number generation, and other digital applications. Autonomous behaviors of such machines with nonsingular characteristic matrix have been widely studied.
openaire +1 more source
On the semigroups of linear sequential machines
International Journal of Computer & Information Sciences, 1973A new and considerably shorter proof is given to the characterization of the groups of linear nonsingular sequential machines due to Ecker.
openaire +1 more source
Comparison of Linear Primary Permanent Magnet Vernier Machine and Linear Vernier Hybrid Machine
IEEE Transactions on Magnetics, 2014This paper presents the comparison of linear primary permanent magnet vernier (LPPMV) machine and linear vernier hybrid (LVH) machine. The LPPMV machine and the LVH machine both operate based on the magnetic gear principle, hence possessing the advantages of low speed and high thrust force density.
Mo, L +7 more
openaire +2 more sources
Two Tests for the Linearity of Sequential Machines
IEEE Transactions on Electronic Computers, 1965This paper describes two tests for the existence of a linear state assignment for binary input sequential machines. The first test is based on ``transfer sequences'' which map one stationary state of a machine onto another stationary state. It is shown that from a minimal transfer sequence of a machine one can read off directly a linear assignment of ...
openaire +1 more source