Results 281 to 290 of about 447,541 (315)

Uniform Modular Realizations and Linear Machines

IEEE Transactions on Computers, 1971
It 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, 1974
The 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, D. K. Chattopadhyay, Arun K. Choudhury   +2 more
openaire   +2 more sources

The Tree Set of a Linear Machine

IEEE Transactions on Electronic Computers, 1965
Linear 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, 1973
A 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, 1965
This 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

Related machine scheduling with machine speeds satisfying linear constraints

Journal of Combinatorial Optimization, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Siyun Zhang, Kameng Nip, Zhenbo Wang
openaire   +1 more source

Linear programming support vector machines

Pattern Recognition, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Weida Zhou, Li Zhang 0004, Licheng Jiao
openaire   +1 more source

Fault tolerant linear state machines

2014 15th Latin American Test Workshop - LATW, 2014
In this paper, a new method for the design of fault-tolerant linear state machines with initial state 0 and one-dimensional input and one-dimensional output is proposed. It is shown that the LFSR-implementation of the transfer function of a linear automaton can be utilized to correct transient errors in the memory elements.
Stefan Weidling, Michael Gössel
openaire   +1 more source

A floquet theory of the linear synchronous machine

Journal of the Franklin Institute, 1983
Abstract The differential equation describing the three-phase linear synchronous machine containing an arbitrary stator MMF distribution is reformulated and solved as a perturbation theory problem. The solution algorithm presented also produces a transformation capable of reducing to constant coefficient form the differential equation describing the ...
J.L. Stensby, C.W. Brice, R.K. Cavin
openaire   +1 more source

Sequential Functions and Linear Sequential Machines

IEEE Transactions on Electronic Computers, 1965
The``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