Orbit-Finite Sets and Their Algorithms (Invited Talk)
Mikołaj Bojańczyk · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2017
An introduction to orbit-finite sets, which are a type of sets that are infinite enough to describe interesting examples, and finite enough to have algorithms running on them. The notion of orbit-finiteness is illustrated on the example of register automata, an automaton model dealing with infinite alphabets.