Bisimulation Finiteness of Pushdown Systems Is Elementary

Prelegent(ci)

Paweł Parys

Afiliacja

Uniwersytet Warszawski

Termin

8 stycznia 2020 14:15

Pokój

p. 5050

Tytuł w języku angielskim

joint work with Stefan Göller

Seminarium

Seminarium „Teoria automatów”

---

We show that in case a pushdown system is bisimulation equivalent to a finite system, then there is already a bisimulation equivalent finite system whose size is elementarily bounded in the description size of the pushdown system. As a consequence we obtain that it is elementarily decidable if a given pushdown system is bisimulation equivalent to some finite system. This improves a previously best-known Ackermann upper bound for this problem.

---