Creative Commons Attribution-NoDerivs 3.0 Unported license (CC BY-ND 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2009.1856
URN: urn:nbn:de:0030-drops-18561
URL: https://drops.dagstuhl.de/opus/volltexte/2009/1856/
Pin, Jean-Eric
Profinite Methods in Automata Theory
| pdf-format: |
|
Abstract
This survey paper presents the success story of the topological approach to automata theory. It is based on profinite topologies, which are built from finite topogical spaces. The survey includes several concrete applications to automata theory.
BibTeX - Entry
@InProceedings{pin:LIPIcs:2009:1856,
author = {Jean-Eric Pin},
title = {{Profinite Methods in Automata Theory}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {31--50},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Susanne Albers and Jean-Yves Marion},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2009/1856},
URN = {urn:nbn:de:0030-drops-18561},
doi = {10.4230/LIPIcs.STACS.2009.1856},
annote = {Keywords: Profinite topology, Regular languages, Uniform space, Finite automata}
}
| Keywords: | Profinite topology, Regular languages, Uniform space, Finite automata | |
| Seminar: | 26th International Symposium on Theoretical Aspects of Computer Science | |
| Issue date: | 2009 | |
| Date of publication: | 19.02.2009 |
