2026-07-20T04:51:04Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:7429 2024-03-06T10:40:15Z ddc:004 open_access

Orbit-Finite Sets and Their Algorithms (Invited Talk) Bojanczyk, Mikolaj Orbit-finite sets sets with atoms data words register automata 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Mikolaj Bojanczyk 2017 Is Part Of LIPIcs, Volume 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICALP.2017.1 urn:nbn:de:0030-drops-74295 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.1 eng https://creativecommons.org/licenses/by/3.0/legalcode