After the outbreak of the coronavirus pandemic, a few scientific communities faced cancellations of conferences, seminars, and research visits. Motivated by the need to establish new communication channels, a series of seminars called One World Seminars was initiated, as an attempt to keep the communities together. The pioneer of this project was One World Probability Seminar that inspired several other One World projects (among which, you might know the One World Combinatorics on Words Seminar).

This is a new series of online research seminars on topics related to Formal Languages and Automata Theory: One FLAT World Seminar (yes, we know, we broke a pattern here: we should have named it “One World FLAT Seminars”, but this name is funnier).

The main goal of this project is to keep the community working in our area alive and updated, by bringing together researchers from all over the world in a virtual, accessible, and inclusive environment. We believe that recently our community is quite fragmented, so having a common platform to share old and recent results on the one hand would help established researchers working on similar topics to find collaborators and fresh ideas and, on the other hand, young people, new in the area, would have a clear vision of what is going on in this branch of theoretical computer science.

The talks will be accessible via Zoom and will run, at least at the beginning, on a monthly basis.

Speakers Wanted!

If you would like to volunteer to be the speaker at one of our sessions in 2026, please feel free to drop us an email with the details of your talk.

Upcoming talks

• Three views on Presburger arithmetic

  Speaker: Dmitry Chistikov

  April 29, 2026 at 13:00 UTC (your local time: )

  

  

  Linear integer arithmetic, also known as Presburger arithmetic, is a logic that allows one to express linear constraints on integers: equalities, inequalities, and divisibility by fixed integers. Sets of natural numbers that can be defined in this logic are ultimately periodic sets. More generally, these are semi-linear sets, introduced in the 1960s by Parikh. [Read More]

• Automata-based verification of quantum circuits

  Speaker: Ondřej Lengál

  May 20, 2026 at 13:00 UTC (your local time: )

  

  

  Development of quantum programs is hard due to their intricate structure and inherently probabilistic nature. Computer-aided tool support is therefore essential. Computer-based reasoning over quantum programs is, however, also challenging due to the exponential size of the program’s state. In this talk, I will present a recent framework for automated formal verification of quantum programs that uses automata to represent complex sets of quantum states compactly.

• Title TBA

  Speaker: Markus Holzer

  June 10, 2026 at 13:00 UTC (your local time: )