Results 251 to 260 of about 481,884 (278)
Some of the next articles are maybe not open access.
Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91, 1991
We present simple randomized algorithms for the fault detection problem: Given a specification in the form of a deterministic finite state machine A and an implementation machine B, determine whether B is equal to A. If A has n states and p inputs, then in randomized polynomial time we can construct with high probability a checking sequence of length O(
openaire +1 more source
We present simple randomized algorithms for the fault detection problem: Given a specification in the form of a deterministic finite state machine A and an implementation machine B, determine whether B is equal to A. If A has n states and p inputs, then in randomized polynomial time we can construct with high probability a checking sequence of length O(
openaire +1 more source
2011
The FSM models we have considered, in spite of many extensions to basic automaton, fall short in many aspects. They have to be extended further, as broadly outlined below, in order to model complex system behavior.
V. S. Alagar, K. Periyasamy
openaire +1 more source
The FSM models we have considered, in spite of many extensions to basic automaton, fall short in many aspects. They have to be extended further, as broadly outlined below, in order to model complex system behavior.
V. S. Alagar, K. Periyasamy
openaire +1 more source
Finite State Machine Decomposition
1992Finite state machine (FSM) decomposition is concerned with the implementation of a FSM as a set of smaller interacting submachines. Such an implementation is desirable for a number of reasons. A partitioned sequential circuit usually leads to improved performance as a result of a reduction in the longest path between latch inputs and outputs. This fact
Pranav Ashar +2 more
openaire +1 more source
2005
In this appendix, we review basic definitions and the Mealy machine model. The definitions and most of the notation follow [LY94, LY96].
openaire +1 more source
In this appendix, we review basic definitions and the Mealy machine model. The definitions and most of the notation follow [LY94, LY96].
openaire +1 more source
Cascaded Finite-State Machines
IEEE Transactions on Electronic Computers, 1961In this paper, networks of finite-state machines, rather than individual machines, are discussed. The investigation centers around cascade networks, where the output of one machine serves as an input to another. It is shown how, by means of connection matrices, the characteristics of such a network can be obtained from those of the component machines ...
openaire +1 more source
Learning Finite State Machines
2010The terms grammatical inference and grammar induction both seem to indicate that techniques aiming at building grammatical formalisms when given some information about a language are not concerned with automata or other finite state machines. This is far from true, and many of the more important results in grammatical inference rely heavily on automata
openaire +1 more source
Finite State Machine Synthesis
1992The fundamental principles for the design of synchronous, finite state machines were outlined in chapter 2. In essence, the design task consists of implementing the state memory of a finite state machine with a set of flip-flops or latches, and determining the corresponding combinatorial logic functions which specify the next-state and outputs of the ...
openaire +1 more source
Monitored Finite State Machines
1972The classical definition of finite state machine has been extended from stationary to time variant systems. Namely, machine structure is defined as a function of time.
openaire +1 more source