Automata theory presents roughly three types of automata: finite automata, pushdown automata and Turing machines. The automata are treated as language acceptors, and the expressiv...
Jos C. M. Baeten, Pieter J. L. Cuijpers, Bas Lutti...
Logical properties of iterations of relational structures are studied and these decidability results are applied to the model checking of a powerful extension of pushdown systems....
show that an abstract analysis of one of these three set theoretic principles can sometimes lead us to results that do not require additional axioms at all but which could have bee...
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
This paper studies document ranking under uncertainty. It is tackled in a general situation where the relevance predictions of individual documents have uncertainty, and are depen...