License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2009.1856
URN: urn:nbn:de:0030-drops-18561
URL: http://drops.dagstuhl.de/opus/volltexte/2009/1856/
Go to the corresponding Portal


Pin, Jean-Eric

Profinite Methods in Automata Theory

pdf-format:
Document 1.pdf (246 KB)


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 =		{http://dx.doi.org/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


DROPS-Home | Fulltext Search | Imprint Published by LZI