The paper “Probabilistic Programming Meets Automata Theory: Exact Inference using Weighted Automata” by Dominik Geißler (TU Berlin) and Tobias Winkler has been accepted for publication in Theoretical Computer Science. The paper introduces probability generating automata (PGA), a class of weighted automata used to encode distributions over nonnegative integers. PGAs can be manipulated via standard automata-theoretic constructions (product, concatenation, etc.) to enable inference in a rich class of probabilistic programs with integer variables.