119 search results - page 10 / 24 » On finite alphabets and infinite bases |
JMLR
2008
13 years 9 months ago
2008
Ensemble learning algorithms such as boosting can achieve better performance by averaging over the predictions of some base hypotheses. Nevertheless, most existing algorithms are ...
CAV
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based o...
CSL
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we fo...
MST
2006
13 years 9 months ago
2006
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...