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.

Next talks

• Cellular automata

  Communication matters

  Speaker: Martin Kutrib

  February 19, 2025 at 14:00 UTC

  

  

  We consider systems of a huge number of interacting finite automata as massively parallel systems. The finite automata (also called cells) are arranged as one-dimensional array and work synchronously at discrete time steps. Naturally, the communication between the cells is necessary for non-trivial computations and, in fact, the amount of communication matters. Here, we focus mainly on measuring the amount of communication quantitatively by the number of messages sent by the cells. Recent results on the computational capacity as well as on decidability problems in such restricted cellular automata are discussed. In particular, fundamental types of communication are considered and... [Read More]