Profinite Methods in Automata Theory

Pin, Jean-Eric

doi:10.4230/LIPIcs.STACS.2009.1856

Document

Profinite Methods in Automata Theory

Author Jean-Eric Pin

Part of: Volume: 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: Symposium on Theoretical Aspects of Computer Science (STACS)
License: Creative Commons Attribution-NoDerivs 3.0 Unported license
Publication Date: 2009-02-19

PDF

File

PDF

LIPIcs.STACS.2009.1856.pdf

Filesize: 246 kB
20 pages

Document Identifiers

DOI: 10.4230/LIPIcs.STACS.2009.1856
URN: urn:nbn:de:0030-drops-18561

Subject Classification

Keywords

Profinite topology
Regular languages
Uniform space
Finite automata

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

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.

Cite As Get 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

Author Details

Jean-Eric Pin

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail