E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
Students learn more through hands-on project experience for computer science courses such as operating systems, but providing the infrastructure support for a large class to learn...
Designing a computer-supported learning scenario involving a constructivist approach of learning lays on a paradox. On the one hand, learning flows must be precisely described –...
Anne Lejeune, Muriel Ney, Armin Weinberger, Margus...
We show that it is possible to use data compression on independently obtained hypotheses from various tasks to algorithmically provide guarantees that the tasks are sufficiently r...