We consider the problem of computing the satisfaction probability of a formula for stochastic models with parametric uncertainty. We show that this satisfaction probability is a s...
Language equivalence and inclusion can be checked coinductively by establishing a (bi)simulation on suitable deterministic automata. In this paper we present an enhancement of thi...
We present a MAT learning algorithm that infers the universal automaton for a regular target language using a polynomial number of queries with respect to that automaton. The univ...
: The rapid growth of information available on the internet has provoked the development of diverse tool for searching and browsing large document collections. Information retrieva...
: Recently, probabilistic topic models such as Latent Dirichlet Allocation (LDA) have been widely used for applications in many text mining tasks such as retrieval, summarization a...