LIPIcs.STACS.2009.1856.pdf
- Filesize: 246 kB
- 20 pages
Document
Profinite Methods in Automata Theory
Author
-
Part of:
Volume:
26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Symposium on Theoretical Aspects of Computer Science (STACS) - License:
Creative Commons Attribution-NoDerivs 3.0 Unported license
- Publication Date: 2009-02-19
Cite AsGet BibTex
Jean-Eric Pin. Profinite Methods in Automata Theory. In 26th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 3, pp. 31-50, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/LIPIcs.STACS.2009.1856
https://doi.org/10.4230/LIPIcs.STACS.2009.1856
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.
Keywords
- Profinite topology
- Regular languages
- Uniform space
- Finite automata
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads