Sciweavers

60 search results - page 3 / 12
» On Generalizations of Weighted Finite Automata and Graphics ...
Sort
View
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 7 months ago
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted ...
Bernard Boigelot, Julien Brusten, Véronique...
COLT
2003
Springer
14 years 21 days ago
Learning from Uncertain Data
The application of statistical methods to natural language processing has been remarkably successful over the past two decades. But, to deal with recent problems arising in this ï¬...
Mehryar Mohri
TACAS
2010
Springer
167views Algorithms» more  TACAS 2010»
14 years 2 months ago
Antichain Algorithms for Finite Automata
Abstract. We present a general theory that exploits simulation relations on transition systems to obtain antichain algorithms for solving the reachability and repeated reachability...
Laurent Doyen, Jean-François Raskin
CONCUR
2010
Springer
13 years 8 months ago
Mean-Payoff Automaton Expressions
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
Krishnendu Chatterjee, Laurent Doyen, Herbert Edel...
TNN
2010
139views Management» more  TNN 2010»
13 years 2 months ago
Identification of finite state automata with a class of recurrent neural networks
A class of recurrent neural networks is proposed and proven to be capable of identifying any discrete-time dynamical system. The application of the proposed network is addressed in...
Sung Hwan Won, Iickho Song, Sun-Young Lee, Cheol H...