81 search results - page 10 / 17 » A Formalisation of Finite Automata Using Hereditarily Finite... |
119
click to vote
ACL
2004
15 years 20 days ago
2004
This paper describes discriminative language modeling for a large vocabulary speech recognition task. We contrast two parameter estimation methods: the perceptron algorithm, and a...
76
Voted
ENTCS
2008
14 years 11 months ago
2008
Non-deterministic (also known as possibilistic) and probabilistic state based systems (or automata) have been studied for quite some time. Separately, they are reasonably well-und...
104
click to vote
ASE
2005
14 years 11 months ago
2005
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
IANDC
2008
14 years 11 months ago
2008
Hybrid systems are dynamical systems with the ability to describe mixed discretecontinuous evolution of a wide range of systems. Consequently, at first glance, hybrid systems appe...
FSTTCS
2006
Springer
15 years 2 months ago
2006
Springer
We observe that pushdown tree automata (PTAs) known in the literature cannot express combinations of branching and pushdown properties. This is because a PTA processes the children...