Evènement pour le groupe Graphes et Logique


Date 2011-12-13  11:00-12:00
TitreRegular languages of infinite trees that are boolean combinations of open sets. 
RésuméThis talk will be about boolean (not necessarily positive) combinations of open sets. I will present a decidable characterization of the regular languages of infinite trees that are boolean combination of open sets. In other words, I will present an algorithm, which inputs a regular language of infinite trees, and decides if the language is a boolean combination of open sets. This algorithm uses algebra and will be introduced as a set identities that are satisfied if and only if a language is a boolean combination of open sets and are easily decidable. 
Lieusalle 76 
OrateurThomas Place 
Emailt.place@mimuw.edu.pl 
UrlUniversity of Warsaw 



Aucun document lié à cet événement.

Retour
Retour à l'index