Results 1  10
of
121,721
Finite State Machines
"... optimization method. They use populations of acceptable solutions (genes) of the given problem, which evolve toward optimum. The genes in standard GA are Boolean vectors. When in synthesis of finite state machine are used JK and RS flipflops there are undefined variables in the activation signals. ..."
Abstract
 Add to MetaCart
optimization method. They use populations of acceptable solutions (genes) of the given problem, which evolve toward optimum. The genes in standard GA are Boolean vectors. When in synthesis of finite state machine are used JK and RS flipflops there are undefined variables in the activation signals
Finite State Machines for BGP
"... This report presents the finite state machines for the BGP decision process, and uses these finite state machines to BGP protocol syntax checking. The routing protocol syntax defines the legitimate sequence of messages and is used to reject invalid messages. If the protocol syntax is well defined, s ..."
Abstract
 Add to MetaCart
This report presents the finite state machines for the BGP decision process, and uses these finite state machines to BGP protocol syntax checking. The routing protocol syntax defines the legitimate sequence of messages and is used to reject invalid messages. If the protocol syntax is well defined
Product Construction of FiniteState Machines
"... Abstract — Two algorithms to construct a product machine from two finitestate machines are presented and analyzed. The first algorithm is simple and correctly produces a product machine, but the product machine may include unreachable states and associated transitions. The second algorithm produces ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract — Two algorithms to construct a product machine from two finitestate machines are presented and analyzed. The first algorithm is simple and correctly produces a product machine, but the product machine may include unreachable states and associated transitions. The second algorithm
Learning Finite State Machines
"... The 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 re ..."
Abstract
 Add to MetaCart
The 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
FINITE STATE MACHINES w
"... The invertibility of finite state machines is considered in detail. Necessary and sufficient conditions for the general class, as well as some important subclasses, of finite state machines to be invertible with delay L (called INV #L if L is the least delay for which an inverse exists) are given. ..."
Abstract
 Add to MetaCart
The invertibility of finite state machines is considered in detail. Necessary and sufficient conditions for the general class, as well as some important subclasses, of finite state machines to be invertible with delay L (called INV #L if L is the least delay for which an inverse exists) are given
On the Implementation of Finite State Machines
 in Proceedings of the 3rd Annual IASTED International Conference Software Engineering and Applications, IASTED/Acta
, 1999
"... Abstract. Finite State Machines (FSM) provide a powerful way to describe dynamic behavior of systems and components. However, the implementation of FSMs in OO languages, often suffers from maintenance problems. The State pattern described in [5] that is commonly used to implement FSMs in OO language ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
Abstract. Finite State Machines (FSM) provide a powerful way to describe dynamic behavior of systems and components. However, the implementation of FSMs in OO languages, often suffers from maintenance problems. The State pattern described in [5] that is commonly used to implement FSMs in OO
In vitro Implementation of FiniteState Machines
"... . We explore the information processing capabilities and efficiency of DNA computations by giving two different types of implementations of finitestate machines. A ligationbased approach allows input of arbitrary length and can be readily implemented with current biotechnology, but requires sequen ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
. We explore the information processing capabilities and efficiency of DNA computations by giving two different types of implementations of finitestate machines. A ligationbased approach allows input of arbitrary length and can be readily implemented with current biotechnology, but requires
Finite state machine for mutation
, 2008
"... In this paper an attempt has been made to represent biological mutational activities through sequential mathematical machines. Begin with a brief theory of finite state sequential machines genetic sequences are presented in a systematic manner. A mutator has been shown as a variety of finite state ..."
Abstract
 Add to MetaCart
In this paper an attempt has been made to represent biological mutational activities through sequential mathematical machines. Begin with a brief theory of finite state sequential machines genetic sequences are presented in a systematic manner. A mutator has been shown as a variety of finite
ON THE IMPLEMENTATION OF FINITE STATE MACHINES
"... Abstract. Finite State Machines (FSM) provide a powerful way to describe dynamic behavior of systems and components. However, the implementation of FSMs in OO languages, often suffers from maintenance problems. The State pattern described in [1] that is commonly used to implement FSMs in OO language ..."
Abstract
 Add to MetaCart
Abstract. Finite State Machines (FSM) provide a powerful way to describe dynamic behavior of systems and components. However, the implementation of FSMs in OO languages, often suffers from maintenance problems. The State pattern described in [1] that is commonly used to implement FSMs in OO
DNA Implementation of FiniteState Machines
, 1997
"... The fundamental information processing capabilities of DNA based reactions have been explored at the upper end of the computability spectrum using splicing systems and establishing computation universality. We explore the information processing capabilities and efficiency of DNA computations from th ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
the other end by giving two different types of implementations of the simplest nontrivial information processing model, the finitestate machine. A ligationbased approach allows input of arbitrary length and can be readily implemented with current biotechnology, but requires sequential input feed
Results 1  10
of
121,721