Sciweavers

DEDS
2002
119views more  DEDS 2002»
13 years 11 months ago
Diagnosing Discrete-Event Systems: Extending the "Diagnoser Approach" to Deal with Telecommunication Networks
Abstract. Detection and isolation of failures in large and complex systems such as telecommunication networks are crucial and challenging tasks. The problem considered here is that...
Laurence Rozé, Marie-Odile Cordier
CSL
2004
Springer
13 years 11 months ago
Arc minimization in finite-state decoding graphs with cross-word acoustic context
Recent approaches to large vocabulary decoding with finite state graphs have focused on the use of state minimization algorithms to produce relatively compact graphs. This paper e...
François Yvon, Geoffrey Zweig, George Saon
TEC
2008
127views more  TEC 2008»
13 years 11 months ago
Fingerprinting: Visualization and Automatic Analysis of Prisoner's Dilemma Strategies
Fingerprinting is a technique for generating a representation-independent functional signature for a game playing agent. Fingerprints can be used to compare agents across represent...
Daniel A. Ashlock, Eun-Youn Kim
BMCBI
2007
159views more  BMCBI 2007»
13 years 11 months ago
Computational genes: a tool for molecular diagnosis and therapy of aberrant mutational phenotype
Background: A finite state machine manipulating information-carrying DNA strands can be used to perform autonomous molecular-scale computations at the cellular level. Results: We ...
Israel Mark Martínez-Pérez, Gong Zha...
CSL
2006
Springer
13 years 11 months ago
The architecture and the implementation of a finite state pronunciation lexicon for Turkish
This paper describes the architecture and the implementation of a full-scale pronunciation lexicon for Turkish using finite state technology. The system produces at its output, a ...
Kemal Oflazer, Sharon Inkelas
COLING
1992
14 years 11 days ago
A Logic Programming View of Relational Morphology
he more abstract term "relational morphology" in place of tile usual "two-level morphology" in order to emphasize an aspect of Koskenniemi's work which ha...
Harvey Abramson
FORTE
1994
14 years 15 days ago
An improvement in formal verification
Critical safety and liveness properties of a concurrent system can often be proven with the help of a reachability analysis of a finite state model. This type of analysis is usual...
Gerard J. Holzmann, Doron Peled
CONCUR
2004
Springer
14 years 2 months ago
Extended Process Rewrite Systems: Expressiveness and Reachability
Abstract. We unify a view on three extensions of Process Rewrite Systems (PRS) and compare their expressive power with that of PRS. We show that the class of Petri nets is less exp...
Mojmír Kretínský, Vojtech Reh...
APL
1992
ACM
14 years 3 months ago
Compiler Tools in APL
We present the design and implementation of APL Intrinsic Functions for a Finite State Machine (also known as a Finite State Automaton) which recognizes regular languages, and a P...
Robert Bernecky, Gert Osterburg
WAIM
2005
Springer
14 years 4 months ago
Simulating a Finite State Mobile Agent System
This paper analyzes the simulation of Finite State mobile agent, which regards the migration, execution, and searching of the mobile agents as finite states. As the finite state mo...
Yong Liu, Congfu Xu, Yanyu Chen, Yunhe Pan