activity
20172024
most citedLearning Pairwise Disjoint Simple Languages from Positive Examples

3 citations · 4 across the 4 of their papers we have counts for

collaborators

5 papers

cs.RO2024

Robust MITL planning under uncertain navigation times

Alexis Linard, Anna Gautier, Daniel Duberg +1

In environments like offices, the duration of a robot's navigation between two locations may vary over time. For instance, reaching a kitchen may take more time during lunchtime si…

cs.FL2019

Fault Trees from Data: Efficient Learning with an Evolutionary Algorithm

Alexis Linard, Doina Bucur, Marielle Stoelinga

Cyber-physical systems come with increasingly complex architectures and failure modes, which complicates the task of obtaining accurate system reliability models. At the same time,…

cs.FL2018

Learning Unions of k-Testable Languages

Alexis Linard, Colin de la Higuera, Frits Vaandrager

A classical problem in grammatical inference is to identify a language from a set of examples. In this paper, we address the problem of identifying a union of languages from exampl…

cs.FL2018★ 1 cited

Learning Several Languages from Labeled Strings: State Merging and Evolutionary Approaches

Alexis Linard

The problem of learning pairwise disjoint deterministic finite automata (DFA) from positive examples has been recently addressed. In this paper, we address the problem of identifyi…

cs.LG2017★ 3 cited

Learning Pairwise Disjoint Simple Languages from Positive Examples

Alexis Linard, Rick Smetsers, Frits Vaandrager +3

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 relat…