Profinite Methods in Automata Theory

Author Jean-Eric Pin



PDF
Thumbnail PDF

File

LIPIcs.STACS.2009.1856.pdf
  • Filesize: 246 kB
  • 20 pages

Document Identifiers

Author Details

Jean-Eric Pin

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

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)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail