Recherche
Conjugacy and equivalence of weighted automata This talk starts with a result witin classical Finite Automata Theory: 'Two regular languages with the
Measurement incompatibility vs. Bell non-locality: an approach via tensor norms. Measurement incompatibility and quantum non-locality are two key
Having query access to a bounded degree directed graph in the unidirectional model means that querying a vertex v reveals the list of vertices u such
We revisit finite-state communicating systems with round-based communication under mailbox semantics. Mailboxes correspond to one FIFO buffer per
/Exposé en anglais/Talk in english/ We study geometric variations of the discriminating code problem. In the discrete version of the problem, a finite
/Exposé en anglais/Talk in english/ What structure can be found in a graph G with large chromatic number? One possibility is that G contains a large
Title: Rewriting consistent answers on annotated data Abstract: In this talk, I'll be discussing results on consistent query answering over databases
/Exposé en anglais/Talk in english/ An $\alpha,\beta$-Kempe swap in a properly colored graph interchanges the colors on some component of the subgraph
The Many-Worlds Calculus: Representing Quantum Control. We explore the interaction between two monoidal structures: a multiplicative one, for the