In this notes we consider the model of Generative Probabilistic Transition Systems, and Baier and Hermanns’ notion of weak bisimulation defined over them. We prove that, if we ...
An ever greater range of applications call for learning from sequences. Grammar induction is one prominent tool for sequence learning, it is therefore important to know its proper...
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
Complexity measures of non-linear dynamics are a useful tool for quantifying observed stretching, folding, scaling and mixing processes in the Takens-reconstructed state space of h...
Mader conjectured that for all there is an integer + ( ) such that every digraph of minimum outdegree at least + ( ) contains a subdivision of a transitive tournament of order . In...