CHANGE!) Reachability for Two-Counter Machines with One Test and One Rese

Speaker(s)

Jerome Leroux

Affiliation

University of Bordeaux

Date

Oct. 17, 2018, 2:15 p.m.

Room

room 5050

Title in Polish

Seminar

Seminar Automata Theory

---

We prove that the reachability relation of two-counter machines with one zero-test and one reset is Presburger-definable and effectively computable. Our proof is based on the introduction of two classes of Presburger-definable relations effectively stable by transitive closure. This approach generalizes and simplifies the existing different proofs and it solves an open problem introduced by Finkel and Sutre in 2000.

Joint work with Alain Finkel and Grégoire Sutre.

---