Sciweavers

274 search results - page 17 / 55
» Weighted Automata and Weighted Logics
Sort
View
ACL
2010
13 years 5 months ago
Efficient Inference through Cascades of Weighted Tree Transducers
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
Jonathan May, Kevin Knight, Heiko Vogler
WIA
2007
Springer
14 years 1 months ago
Average Value and Variance of Pattern Statistics in Rational Models
We study the pattern statistics representing the number of occurrences of a given string in a word of length n generated at random by rational stochastic models, defined by means ...
Massimiliano Goldwurm, Roberto Radicioni
ACTA
2004
87views more  ACTA 2004»
13 years 7 months ago
P systems with symport/antiport simulating counter automata
The generative capability of several variants of P systems with symport/antiport is studied via the simulation of counter automata. This leads to the reduction of the complexity, e...
Pierluigi Frisco, Hendrik Jan Hoogeboom
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...
LPAR
2010
Springer
13 years 5 months ago
Coping with Selfish On-Going Behaviors
A rational and selfish environment may have an incentive to cheat the system it interacts with. Cheating the system amounts to reporting a stream of inputs that is different from ...
Orna Kupferman, Tami Tamir