Results 221 to 230 of about 382,293 (264)
Some of the next articles are maybe not open access.
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
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
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
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
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
Sequential Functions and Linear Sequential Machines
IEEE Transactions on Electronic Computers, 1965The``state'' of a sequential machine is interpreted as the sequence-to-sequence input-output mapping performed by the machine. Such mappings have been called sequential functions. This concept of state is applied to the theory of binary linear sequential machines.
openaire +1 more source
Related machine scheduling with machine speeds satisfying linear constraints
Journal of Combinatorial Optimization, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Siyun Zhang, Kameng Nip, Zhenbo Wang
openaire +1 more source