About max-plus and min-plus automata:

Prelegent(ci)

Laure Laviaud

Afiliacja

Uniwersytet Warszawski

Termin

12 października 2016 14:15

Pokój

p. 5870

Tytuł w języku angielskim

un)decidabilit

Seminarium

Seminarium „Teoria automatów”

---

In this talk, I will present min-plus and max-plus automata, which are a kind of weighted automata computing functions from the set of words to the integers. I will give some classical results about decision problems (equivalence, comparison, determinisation) and - most important - I will give a lot of remaining open problems on the subject.
Depending on time, I will try to give general ideas of how to address these problems via the matrix representation of weighted automata.

---