Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2017.1
URN: urn:nbn:de:0030-drops-74295
URL: https://drops.dagstuhl.de/opus/volltexte/2017/7429/
Bojanczyk, Mikolaj
Orbit-Finite Sets and Their Algorithms (Invited Talk)
| pdf-format: |
|
Abstract
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.
BibTeX - Entry
@InProceedings{bojanczyk:LIPIcs:2017:7429,
author = {Mikolaj Bojanczyk},
title = {{Orbit-Finite Sets and Their Algorithms (Invited Talk)}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {1:1--1:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca Muscholl},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7429},
URN = {urn:nbn:de:0030-drops-74295},
doi = {10.4230/LIPIcs.ICALP.2017.1},
annote = {Keywords: Orbit-finite sets, sets with atoms, data words, register automata}
}
| Keywords: | Orbit-finite sets, sets with atoms, data words, register automata | |
| Seminar: | 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) | |
| Issue date: | 2017 | |
| Date of publication: | 07.07.2017 |
