Results 11  20
of
7,534
Methodology and Tools for State Encoding in Asynchronous Circuit Synthesis
, 1996
"... This paper proposes a state encoding method for asynchronous circuits based on the theory of regions. A region in a Transition System is a set of states that "behave uniformly" with respect to a given transition (value change of an observable signal), and is analogue to a place in a Petri ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
This paper proposes a state encoding method for asynchronous circuits based on the theory of regions. A region in a Transition System is a set of states that "behave uniformly" with respect to a given transition (value change of an observable signal), and is analogue to a place in a Petri
FSMs state encoding targeting at logic level minimization
, 2006
"... Abstract. The paper concerns the problem of state assignment for finite state machines (FSM), targeting at PALbased CPLDs implementations. Presented in the paper approach is dedicated to state encoding of fast automata. The main idea is to determine the number of logic levels of the transition func ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. The paper concerns the problem of state assignment for finite state machines (FSM), targeting at PALbased CPLDs implementations. Presented in the paper approach is dedicated to state encoding of fast automata. The main idea is to determine the number of logic levels of the transition
Distributed representations, simple recurrent networks, and grammatical structure
 Machine Learning
, 1991
"... Abstract. In this paper three problems for a connectionist account of language are considered: 1. What is the nature of linguistic representations? 2. How can complex structural relationships such as constituent structure be represented? 3. How can the apparently openended nature of language be acc ..."
Abstract

Cited by 401 (17 self)
 Add to MetaCart
complex distributed representations which encode the relevant grammatical relations and hierarchical constituent structure. Differences between the SRN state representations and the more traditional pushdown store are discussed in the final section.
Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length
 In ECP
, 1999
"... In this paper we present a generalpurposed algorithm for transforming a planning problem specified in Strips into a concise state description for single state or symbolic exploration. The process of finding a state description consists of four phases. In the first phase we symbolically analyze the ..."
Abstract

Cited by 57 (19 self)
 Add to MetaCart
the domain specification to determine constant and oneway predicates, i.e. predicates that remain unchanged by all operators or toggle in only one direction, respectively. In the second phase we symbolically merge predicates which lead to a drastic reduction of state encoding size, while in the third phase
ON THE INFLUENCE OF THE STATE ENCODING ON OBDDREPRESENTATIONS OF FINITE STATE MACHINES
, 1999
"... Ordered binary decision diagrams are an important data structure for the representation of Boolean functions. Typically, the underlying variable ordering is used as an optimization parameter. When finite state machines are represented by OBDDs the state encoding can be used as an additional optimiza ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Ordered binary decision diagrams are an important data structure for the representation of Boolean functions. Typically, the underlying variable ordering is used as an optimization parameter. When finite state machines are represented by OBDDs the state encoding can be used as an additional
Complete State Encoding Based on the Theory of Regions
 In International Symposium on Advanced Research in Asynchronous Circuits and Systems, Aizu
, 1996
"... Synthesis of asynchronous circuits from Signal Transition Graphs (STGs) and/or State Graphs (SGs) involves solving state coding problems. A wellknown example of such problems is that of Complete State Coding (CSC), which happens when a pair of different states in an SG has the same binary encoding. ..."
Abstract

Cited by 22 (8 self)
 Add to MetaCart
Synthesis of asynchronous circuits from Signal Transition Graphs (STGs) and/or State Graphs (SGs) involves solving state coding problems. A wellknown example of such problems is that of Complete State Coding (CSC), which happens when a pair of different states in an SG has the same binary encoding
A hidden Markov model for predicting transmembrane helices in protein sequences
 In Proceedings of the 6th International Conference on Intelligent Systems for Molecular Biology (ISMB
, 1998
"... A novel method to model and predict the location and orientation of alpha helices in membrane spanning proteins is presented. It is based on a hidden Markov model (HMM) with an architecture that corresponds closely to the biological system. The model is cyclic with 7 types of states for helix core, ..."
Abstract

Cited by 373 (9 self)
 Add to MetaCart
different membrane insertions mechanisms. The close mapping between the biological and computational states allows us to infer which parts of the model architecture are important to capture the information that encodes the membrane topology, and to gain a better understanding of the mechanisms
Exploiting state encoding for invariant generation in inductionbased property checking
 in ASPDAC
, 2004
"... Abstract — This paper focuses on checking safety properties for sequential circuits specified on the RTlevel. We study how different state encodings can be used to create a gatelevel representation of the circuit that facilitates the computation of effective invariants for inductionbased property ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract — This paper focuses on checking safety properties for sequential circuits specified on the RTlevel. We study how different state encodings can be used to create a gatelevel representation of the circuit that facilitates the computation of effective invariants for inductionbased property
Good quantum error correcting codes exist
 REV. A
, 1996
"... A quantum errorcorrecting code is defined to be a unitary mapping (encoding) of k qubits (2state quantum systems) into a subspace of the quantum state space of n qubits such that if any t of the qubits undergo arbitrary decoherence, not necessarily independently, the resulting n qubits can be used ..."
Abstract

Cited by 349 (9 self)
 Add to MetaCart
A quantum errorcorrecting code is defined to be a unitary mapping (encoding) of k qubits (2state quantum systems) into a subspace of the quantum state space of n qubits such that if any t of the qubits undergo arbitrary decoherence, not necessarily independently, the resulting n qubits can
An Efficient TCAMBased Implementation of Multipattern Matching Using Covered State Encoding
"... Abstract—This paper proposes a state encoding scheme called a covered state encoding for the efficient TCAMbased implementation of the AhoCorasick multipattern matching algorithm, which is widely used in network intrusion detection systems. Since the information of failure transitions of the AhoC ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract—This paper proposes a state encoding scheme called a covered state encoding for the efficient TCAMbased implementation of the AhoCorasick multipattern matching algorithm, which is widely used in network intrusion detection systems. Since the information of failure transitions of the Aho
Results 11  20
of
7,534