Evènement pour le groupe Séminaire Méthodes Formelles


Date 2021-11-16  07:00-07:00
TitreConstructing Deterministic Omega-Automata from Examples by an Extension of the RPNI Algorithm 
RésuméLearning techniques for deterministic finite automata (DFA) have been developed starting from the 1970ies. The two main settings are the construction of DFA from examples (finite sets of words that should be accepted or rejected by the DFA), and from queries to an oracle. These problems are already well understood for DFA, and various learning algorithms for these two settings exist. Deterministic automata on infinite words define languages of infinite words, and are syntactically very similar to DFA. However, certain key properties of DFA that are used in learning algorithms do not hold for automata on infinite words. Therefore, only few results for learning automata over infinite words have been obtained up to now. In this talk, I present an algorithm for the construction of deterministic omega-automata from examples that is obtained by adapting an algorithm called RPNI from the setting of finite words. 
LieuOnline 
OrateurChristof Löding 
Emailhttps://www.lics.rwth-aachen.de/go/id/ocsx/lidx/1 
UrlRWTH Aachen University 



Aucun document lié à cet événement.

Retour
Retour à l'index