Sciweavers

184 search results - page 3 / 37
» A New Algorithm of Constructing the Basis Finite Automaton
Sort
View
CUZA
2010
150views Cryptology» more  CUZA 2010»
13 years 3 months ago
Symbolic Synthesis of Mealy Machines from Arithmetic Bitstream Functions
In this paper, we describe a symbolic synthesis method which given an algebraic expression that specifies a bitstream function f, constructs a (minimal) Mealy machine that realise...
Helle Hvid Hansen, Jan J. M. M. Rutten
TASLP
2010
106views more  TASLP 2010»
13 years 14 days ago
Efficient and Robust Music Identification With Weighted Finite-State Transducers
We present an approach to music identification based on weighted finite-state transducers and Gaussian mixture models, inspired by techniques used in large-vocabulary speech recogn...
Mehryar Mohri, Pedro Moreno, Eugene Weinstein
NAACL
2003
13 years 7 months ago
Simpler and More General Minimization for Weighted Finite-State Automata
Previous work on minimizing weighted finite-state automata (including transducers) is limited to particular types of weights. We present efficient new minimization algorithms th...
Jason Eisner
AAAI
1992
13 years 7 months ago
Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning
It is often useful for a robot to construct a spatial representation of its environment from experiments and observations, in other words, to learn a map of its environment by exp...
Thomas Dean, Dana Angluin, Kenneth Basye, Sean P. ...
CONCUR
2009
Springer
14 years 9 days ago
Winning Regions of Pushdown Parity Games: A Saturation Method
We present a new algorithm for computing the winning region of a parity game played over the configuration graph of a pushdown system. Our method gives the first extension of the...
Matthew Hague, C.-H. Luke Ong