Learning Pairwise Disjoint Simple Languages from Positive Examples

Alexis Linard (Speaker), Rick Smetsers (Speaker), FW Vaandrager (Speaker), Umar Waqas (Speaker), Joost van Pinxten (Speaker), Verwer, S. E. (Speaker)

Activity: Talk or presentationTalk or presentation at a workshop, seminar, course or other meeting


A classical problem in grammatical inference is to identify a deterministic finite automaton (DFA) from a set of positive and negative examples. In this paper, we address the related – yet seemingly novel – problem of identifying a set of DFAs from examples that belong to different unknown sim ple regular languages. We propose two methods based on compression for clustering the observed positive examples. We apply our methods to a set of print jobs submitted to large industrial printers.
Period19 Jun 2017
Event titleLearnAut workshop: part of LICS'17: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science
Event typeWorkshop
LocationReykjavik, Iceland