644 search results - page 28 / 129 » Precedence Automata and Languages |
IANDC
2008
14 years 11 months ago
2008
CONCUR
2009
Springer
15 years 6 months ago
2009
Springer
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...
COLT
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. Probabilistic finite automata (PFA) model stochastic languages, i.e. probability distributions over strings. Inferring PFA from stochastic data is an open field of rese...
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. This paper studies the expressive power of finite-state automata recognizing sets of real numbers encoded positionally. It is known that the sets that are definable in th...
EACL
2006
ACL Anthology
15 years 24 days ago
2006
ACL Anthology
This paper describes a study in which a corpus of spoken Danish annotated with focus and topic tags was used to investigate the relation between information structure and pauses. ...