Search Results

Documents authored by Pin, Jean-Eric


Found 2 Possible Name Variants:

Pin, Jean-Eric

Document
Track B: Automata, Logic, Semantics, and Theory of Programming
A Mahler’s Theorem for Word Functions (Track B: Automata, Logic, Semantics, and Theory of Programming)

Authors: Jean-Éric Pin and Christophe Reutenauer

Published in: LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)


Abstract
Let p be a prime number and let G_p be the variety of all languages recognised by a finite p-group. We give a construction process of all G_p-preserving functions from a free monoid to a free group. Our result follows from a new noncommutative generalization of Mahler’s theorem on interpolation series, a celebrated result of p-adic analysis.

Cite as

Jean-Éric Pin and Christophe Reutenauer. A Mahler’s Theorem for Word Functions (Track B: Automata, Logic, Semantics, and Theory of Programming). In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, pp. 125:1-125:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)


Copy BibTex To Clipboard

@InProceedings{pin_et_al:LIPIcs.ICALP.2019.125,
  author =	{Pin, Jean-\'{E}ric and Reutenauer, Christophe},
  title =	{{A Mahler’s Theorem for Word Functions}},
  booktitle =	{46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
  pages =	{125:1--125:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-109-2},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{132},
  editor =	{Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.125},
  URN =		{urn:nbn:de:0030-drops-107019},
  doi =		{10.4230/LIPIcs.ICALP.2019.125},
  annote =	{Keywords: group languages, interpolation series, pro-p metric, regularity preserving}
}
Document
Varieties of Cost Functions

Authors: Laure Daviaud, Denis Kuperberg, and Jean-Éric Pin

Published in: LIPIcs, Volume 47, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)


Abstract
Regular cost functions were introduced as a quantitative generalisation of regular languages, retaining many of their equivalent characterisations and decidability properties. For instance, stabilisation monoids play the same role for cost functions as monoids do for regular languages. The purpose of this article is to further extend this algebraic approach by generalising two results on regular languages to cost functions: Eilenberg's varieties theorem and profinite equational characterisations of lattices of regular languages. This opens interesting new perspectives, but the specificities of cost functions introduce difficulties that prevent these generalisations to be straightforward. In contrast, although syntactic algebras can be defined for formal power series over a commutative ring, no such notion is known for series over semirings and in particular over the tropical semiring.

Cite as

Laure Daviaud, Denis Kuperberg, and Jean-Éric Pin. Varieties of Cost Functions. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 30:1-30:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)


Copy BibTex To Clipboard

@InProceedings{daviaud_et_al:LIPIcs.STACS.2016.30,
  author =	{Daviaud, Laure and Kuperberg, Denis and Pin, Jean-\'{E}ric},
  title =	{{Varieties of Cost Functions}},
  booktitle =	{33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)},
  pages =	{30:1--30:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-001-9},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{47},
  editor =	{Ollinger, Nicolas and Vollmer, Heribert},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.30},
  URN =		{urn:nbn:de:0030-drops-57319},
  doi =		{10.4230/LIPIcs.STACS.2016.30},
  annote =	{Keywords: Cost functions, regular language, varieties, syntactic algebra}
}
Document
Duality in Computer Science (Dagstuhl Seminar 13311)

Authors: Mai Gehrke, Jean-Eric Pin, Victor Selivanov, and Dieter Spreen

Published in: Dagstuhl Reports, Volume 3, Issue 7 (2013)


Abstract
Duality allows one to move between the two worlds: the world of certain algebras of properties and a spacial world of individuals, thereby leading to a change of perspective that may, and often does, lead to new insights. Dualities have given rise to active research in a number of areas of theoretical computer science. Dagstuhl Seminar 13311 "Duality in Computer Science" was held to stimulate research in this area. This report collects the ideas that were presented and discussed during the course of the seminar.

Cite as

Mai Gehrke, Jean-Eric Pin, Victor Selivanov, and Dieter Spreen. Duality in Computer Science (Dagstuhl Seminar 13311). In Dagstuhl Reports, Volume 3, Issue 7, pp. 54-73, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)


Copy BibTex To Clipboard

@Article{gehrke_et_al:DagRep.3.7.54,
  author =	{Gehrke, Mai and Pin, Jean-Eric and Selivanov, Victor and Spreen, Dieter},
  title =	{{Duality in Computer Science (Dagstuhl Seminar 13311)}},
  pages =	{54--73},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{3},
  number =	{7},
  editor =	{Gehrke, Mai and Pin, Jean-Eric and Selivanov, Victor and Spreen, Dieter},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.3.7.54},
  URN =		{urn:nbn:de:0030-drops-43068},
  doi =		{10.4230/DagRep.3.7.54},
  annote =	{Keywords: Stone-Priestley duality, Point free topology, Infinite computations Exact real number computation, Computability in analysis, Hierarchies, Reducibilit Topological complexity, Domain theory, Semantics, Recognizability, Profinite topology}
}
Document
10501 Abstracts Collection – Advances and Applications of Automata on Words and Trees

Authors: Christian Glasser, Jean-Eric Pin, Nicole Schweikardt, Victor Selivanov, and Wolfgang Thomas

Published in: Dagstuhl Seminar Proceedings, Volume 10501, Advances and Applications of Automata on Words and Trees (2011)


Abstract
From 12.12.2010 to 17.12.2010, the Dagstuhl Seminar 10501 ``Advances and Applications of Automata on Words and Trees'' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.

Cite as

Christian Glasser, Jean-Eric Pin, Nicole Schweikardt, Victor Selivanov, and Wolfgang Thomas. 10501 Abstracts Collection – Advances and Applications of Automata on Words and Trees. In Advances and Applications of Automata on Words and Trees. Dagstuhl Seminar Proceedings, Volume 10501, pp. 1-12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2011)


Copy BibTex To Clipboard

@InProceedings{glasser_et_al:DagSemProc.10501.1,
  author =	{Glasser, Christian and Pin, Jean-Eric and Schweikardt, Nicole and Selivanov, Victor and Thomas, Wolfgang},
  title =	{{10501 Abstracts Collection – Advances and Applications of Automata on Words and Trees}},
  booktitle =	{Advances and Applications of Automata on Words and Trees},
  pages =	{1--12},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2011},
  volume =	{10501},
  editor =	{Christian Glasser and Jean-Eric Pin and Nicole Schweikardt and Victor Selivanov and Wolfgang Thomas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10501.1},
  URN =		{urn:nbn:de:0030-drops-31486},
  doi =		{10.4230/DagSemProc.10501.1},
  annote =	{Keywords: Automata theory, logic, verification, data structures, algorithms, complexity, games, infinite games with perfect information, reactive systems, specification and verification, combinatorics, hierarchies and reducibilities}
}
Document
10501 Executive Summary – Advances and Applications of Automata on Words and Trees

Authors: Christian Glasser, Jean-Eric Pin, Nicole Schweikardt, Victor Selivanov, and Wolfgang Thomas

Published in: Dagstuhl Seminar Proceedings, Volume 10501, Advances and Applications of Automata on Words and Trees (2011)


Abstract
The aim of the seminar was to discuss and systematize the recent fast progress in automata theory and to identify important directions for future research. For this, the seminar brought together more than 40 researchers from automata theory and related fields of applications. We had 19 talks of 30 minutes and 5 one-hour lectures leaving ample room for discussions. In the following we describe the topics in more detail.

Cite as

Christian Glasser, Jean-Eric Pin, Nicole Schweikardt, Victor Selivanov, and Wolfgang Thomas. 10501 Executive Summary – Advances and Applications of Automata on Words and Trees. In Advances and Applications of Automata on Words and Trees. Dagstuhl Seminar Proceedings, Volume 10501, pp. 1-4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2011)


Copy BibTex To Clipboard

@InProceedings{glasser_et_al:DagSemProc.10501.2,
  author =	{Glasser, Christian and Pin, Jean-Eric and Schweikardt, Nicole and Selivanov, Victor and Thomas, Wolfgang},
  title =	{{10501 Executive Summary – Advances and Applications of Automata on Words and Trees}},
  booktitle =	{Advances and Applications of Automata on Words and Trees},
  pages =	{1--4},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2011},
  volume =	{10501},
  editor =	{Christian Glasser and Jean-Eric Pin and Nicole Schweikardt and Victor Selivanov and Wolfgang Thomas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10501.2},
  URN =		{urn:nbn:de:0030-drops-31474},
  doi =		{10.4230/DagSemProc.10501.2},
  annote =	{Keywords: Infinite games with perfect information, reactive systems, specification and verification, combinatorics, hierarchies and reducibilities}
}
Document
Profinite Methods in Automata Theory

Authors: Jean-Eric Pin

Published in: LIPIcs, Volume 3, 26th International Symposium on Theoretical Aspects of Computer Science (2009)


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

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)


Copy BibTex To Clipboard

@InProceedings{pin:LIPIcs.STACS.2009.1856,
  author =	{Pin, Jean-Eric},
  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 =	{Albers, Susanne and Marion, Jean-Yves},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.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}
}
Document
A Mahler's theorem for functions from words to integers

Authors: Jean-Eric Pin and Pedro V. Silva

Published in: LIPIcs, Volume 1, 25th International Symposium on Theoretical Aspects of Computer Science (2008)


Abstract
In this paper, we prove an extension of Mahler's theorem, a celebrated result of $p$-adic analysis. Mahler's original result states that a function from $N$ to $Z$ is uniformly continuous for the $p$-adic metric $d_p$ if and only if it can be uniformly approximated by polynomial functions. We prove the same result for functions from $A^*$ to $Z$, where $d_p$ is now the profinite metric defined by $p$-groups (pro-$p$ metric).

Cite as

Jean-Eric Pin and Pedro V. Silva. A Mahler's theorem for functions from words to integers. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 585-596, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)


Copy BibTex To Clipboard

@InProceedings{pin_et_al:LIPIcs.STACS.2008.1321,
  author =	{Pin, Jean-Eric and Silva, Pedro V.},
  title =	{{A Mahler's theorem for functions from words to integers}},
  booktitle =	{25th International Symposium on Theoretical Aspects of Computer Science},
  pages =	{585--596},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-06-4},
  ISSN =	{1868-8969},
  year =	{2008},
  volume =	{1},
  editor =	{Albers, Susanne and Weil, Pascal},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1321},
  URN =		{urn:nbn:de:0030-drops-13212},
  doi =		{10.4230/LIPIcs.STACS.2008.1321},
  annote =	{Keywords: \$p\$-adic topology, binomial coefficients, Mahler's theorem, \$p\$-group languages}
}
Document
Automata Theory: Infinite Computations (Dagstuhl Seminar 9202)

Authors: Kevin Compton, Jean-Eric Pin, and Wolfgang Thomas

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)


Abstract

Cite as

Kevin Compton, Jean-Eric Pin, and Wolfgang Thomas. Automata Theory: Infinite Computations (Dagstuhl Seminar 9202). Dagstuhl Seminar Report 28, pp. 1-29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (1992)


Copy BibTex To Clipboard

@TechReport{compton_et_al:DagSemRep.28,
  author =	{Compton, Kevin and Pin, Jean-Eric and Thomas, Wolfgang},
  title =	{{Automata Theory: Infinite Computations (Dagstuhl Seminar 9202)}},
  pages =	{1--29},
  ISSN =	{1619-0203},
  year =	{1992},
  type = 	{Dagstuhl Seminar Report},
  number =	{28},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.28},
  URN =		{urn:nbn:de:0030-drops-149166},
  doi =		{10.4230/DagSemRep.28},
}
Document
Automata Theory and Applications in Logic and Complexity (Dagstuhl Seminar 9103)

Authors: Jean Berstel, Jean-Eric Pin, and Wolgang Thoma

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)


Abstract

Cite as

Jean Berstel, Jean-Eric Pin, and Wolgang Thoma. Automata Theory and Applications in Logic and Complexity (Dagstuhl Seminar 9103). Dagstuhl Seminar Report 5, pp. 1-24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (1991)


Copy BibTex To Clipboard

@TechReport{berstel_et_al:DagSemRep.5,
  author =	{Berstel, Jean and Pin, Jean-Eric and Thoma, Wolgang},
  title =	{{Automata Theory and Applications in Logic and Complexity (Dagstuhl Seminar 9103)}},
  pages =	{1--24},
  ISSN =	{1619-0203},
  year =	{1991},
  type = 	{Dagstuhl Seminar Report},
  number =	{5},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.5},
  URN =		{urn:nbn:de:0030-drops-148935},
  doi =		{10.4230/DagSemRep.5},
}

Pin, Jean-Éric

Document
Track B: Automata, Logic, Semantics, and Theory of Programming
A Mahler’s Theorem for Word Functions (Track B: Automata, Logic, Semantics, and Theory of Programming)

Authors: Jean-Éric Pin and Christophe Reutenauer

Published in: LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)


Abstract
Let p be a prime number and let G_p be the variety of all languages recognised by a finite p-group. We give a construction process of all G_p-preserving functions from a free monoid to a free group. Our result follows from a new noncommutative generalization of Mahler’s theorem on interpolation series, a celebrated result of p-adic analysis.

Cite as

Jean-Éric Pin and Christophe Reutenauer. A Mahler’s Theorem for Word Functions (Track B: Automata, Logic, Semantics, and Theory of Programming). In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, pp. 125:1-125:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)


Copy BibTex To Clipboard

@InProceedings{pin_et_al:LIPIcs.ICALP.2019.125,
  author =	{Pin, Jean-\'{E}ric and Reutenauer, Christophe},
  title =	{{A Mahler’s Theorem for Word Functions}},
  booktitle =	{46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
  pages =	{125:1--125:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-109-2},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{132},
  editor =	{Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.125},
  URN =		{urn:nbn:de:0030-drops-107019},
  doi =		{10.4230/LIPIcs.ICALP.2019.125},
  annote =	{Keywords: group languages, interpolation series, pro-p metric, regularity preserving}
}
Document
Varieties of Cost Functions

Authors: Laure Daviaud, Denis Kuperberg, and Jean-Éric Pin

Published in: LIPIcs, Volume 47, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)


Abstract
Regular cost functions were introduced as a quantitative generalisation of regular languages, retaining many of their equivalent characterisations and decidability properties. For instance, stabilisation monoids play the same role for cost functions as monoids do for regular languages. The purpose of this article is to further extend this algebraic approach by generalising two results on regular languages to cost functions: Eilenberg's varieties theorem and profinite equational characterisations of lattices of regular languages. This opens interesting new perspectives, but the specificities of cost functions introduce difficulties that prevent these generalisations to be straightforward. In contrast, although syntactic algebras can be defined for formal power series over a commutative ring, no such notion is known for series over semirings and in particular over the tropical semiring.

Cite as

Laure Daviaud, Denis Kuperberg, and Jean-Éric Pin. Varieties of Cost Functions. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 30:1-30:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)


Copy BibTex To Clipboard

@InProceedings{daviaud_et_al:LIPIcs.STACS.2016.30,
  author =	{Daviaud, Laure and Kuperberg, Denis and Pin, Jean-\'{E}ric},
  title =	{{Varieties of Cost Functions}},
  booktitle =	{33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)},
  pages =	{30:1--30:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-001-9},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{47},
  editor =	{Ollinger, Nicolas and Vollmer, Heribert},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.30},
  URN =		{urn:nbn:de:0030-drops-57319},
  doi =		{10.4230/LIPIcs.STACS.2016.30},
  annote =	{Keywords: Cost functions, regular language, varieties, syntactic algebra}
}
Document
Duality in Computer Science (Dagstuhl Seminar 13311)

Authors: Mai Gehrke, Jean-Eric Pin, Victor Selivanov, and Dieter Spreen

Published in: Dagstuhl Reports, Volume 3, Issue 7 (2013)


Abstract
Duality allows one to move between the two worlds: the world of certain algebras of properties and a spacial world of individuals, thereby leading to a change of perspective that may, and often does, lead to new insights. Dualities have given rise to active research in a number of areas of theoretical computer science. Dagstuhl Seminar 13311 "Duality in Computer Science" was held to stimulate research in this area. This report collects the ideas that were presented and discussed during the course of the seminar.

Cite as

Mai Gehrke, Jean-Eric Pin, Victor Selivanov, and Dieter Spreen. Duality in Computer Science (Dagstuhl Seminar 13311). In Dagstuhl Reports, Volume 3, Issue 7, pp. 54-73, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)


Copy BibTex To Clipboard

@Article{gehrke_et_al:DagRep.3.7.54,
  author =	{Gehrke, Mai and Pin, Jean-Eric and Selivanov, Victor and Spreen, Dieter},
  title =	{{Duality in Computer Science (Dagstuhl Seminar 13311)}},
  pages =	{54--73},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{3},
  number =	{7},
  editor =	{Gehrke, Mai and Pin, Jean-Eric and Selivanov, Victor and Spreen, Dieter},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.3.7.54},
  URN =		{urn:nbn:de:0030-drops-43068},
  doi =		{10.4230/DagRep.3.7.54},
  annote =	{Keywords: Stone-Priestley duality, Point free topology, Infinite computations Exact real number computation, Computability in analysis, Hierarchies, Reducibilit Topological complexity, Domain theory, Semantics, Recognizability, Profinite topology}
}
Document
10501 Abstracts Collection – Advances and Applications of Automata on Words and Trees

Authors: Christian Glasser, Jean-Eric Pin, Nicole Schweikardt, Victor Selivanov, and Wolfgang Thomas

Published in: Dagstuhl Seminar Proceedings, Volume 10501, Advances and Applications of Automata on Words and Trees (2011)


Abstract
From 12.12.2010 to 17.12.2010, the Dagstuhl Seminar 10501 ``Advances and Applications of Automata on Words and Trees'' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.

Cite as

Christian Glasser, Jean-Eric Pin, Nicole Schweikardt, Victor Selivanov, and Wolfgang Thomas. 10501 Abstracts Collection – Advances and Applications of Automata on Words and Trees. In Advances and Applications of Automata on Words and Trees. Dagstuhl Seminar Proceedings, Volume 10501, pp. 1-12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2011)


Copy BibTex To Clipboard

@InProceedings{glasser_et_al:DagSemProc.10501.1,
  author =	{Glasser, Christian and Pin, Jean-Eric and Schweikardt, Nicole and Selivanov, Victor and Thomas, Wolfgang},
  title =	{{10501 Abstracts Collection – Advances and Applications of Automata on Words and Trees}},
  booktitle =	{Advances and Applications of Automata on Words and Trees},
  pages =	{1--12},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2011},
  volume =	{10501},
  editor =	{Christian Glasser and Jean-Eric Pin and Nicole Schweikardt and Victor Selivanov and Wolfgang Thomas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10501.1},
  URN =		{urn:nbn:de:0030-drops-31486},
  doi =		{10.4230/DagSemProc.10501.1},
  annote =	{Keywords: Automata theory, logic, verification, data structures, algorithms, complexity, games, infinite games with perfect information, reactive systems, specification and verification, combinatorics, hierarchies and reducibilities}
}
Document
10501 Executive Summary – Advances and Applications of Automata on Words and Trees

Authors: Christian Glasser, Jean-Eric Pin, Nicole Schweikardt, Victor Selivanov, and Wolfgang Thomas

Published in: Dagstuhl Seminar Proceedings, Volume 10501, Advances and Applications of Automata on Words and Trees (2011)


Abstract
The aim of the seminar was to discuss and systematize the recent fast progress in automata theory and to identify important directions for future research. For this, the seminar brought together more than 40 researchers from automata theory and related fields of applications. We had 19 talks of 30 minutes and 5 one-hour lectures leaving ample room for discussions. In the following we describe the topics in more detail.

Cite as

Christian Glasser, Jean-Eric Pin, Nicole Schweikardt, Victor Selivanov, and Wolfgang Thomas. 10501 Executive Summary – Advances and Applications of Automata on Words and Trees. In Advances and Applications of Automata on Words and Trees. Dagstuhl Seminar Proceedings, Volume 10501, pp. 1-4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2011)


Copy BibTex To Clipboard

@InProceedings{glasser_et_al:DagSemProc.10501.2,
  author =	{Glasser, Christian and Pin, Jean-Eric and Schweikardt, Nicole and Selivanov, Victor and Thomas, Wolfgang},
  title =	{{10501 Executive Summary – Advances and Applications of Automata on Words and Trees}},
  booktitle =	{Advances and Applications of Automata on Words and Trees},
  pages =	{1--4},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2011},
  volume =	{10501},
  editor =	{Christian Glasser and Jean-Eric Pin and Nicole Schweikardt and Victor Selivanov and Wolfgang Thomas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10501.2},
  URN =		{urn:nbn:de:0030-drops-31474},
  doi =		{10.4230/DagSemProc.10501.2},
  annote =	{Keywords: Infinite games with perfect information, reactive systems, specification and verification, combinatorics, hierarchies and reducibilities}
}
Document
Profinite Methods in Automata Theory

Authors: Jean-Eric Pin

Published in: LIPIcs, Volume 3, 26th International Symposium on Theoretical Aspects of Computer Science (2009)


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

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)


Copy BibTex To Clipboard

@InProceedings{pin:LIPIcs.STACS.2009.1856,
  author =	{Pin, Jean-Eric},
  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 =	{Albers, Susanne and Marion, Jean-Yves},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.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}
}
Document
A Mahler's theorem for functions from words to integers

Authors: Jean-Eric Pin and Pedro V. Silva

Published in: LIPIcs, Volume 1, 25th International Symposium on Theoretical Aspects of Computer Science (2008)


Abstract
In this paper, we prove an extension of Mahler's theorem, a celebrated result of $p$-adic analysis. Mahler's original result states that a function from $N$ to $Z$ is uniformly continuous for the $p$-adic metric $d_p$ if and only if it can be uniformly approximated by polynomial functions. We prove the same result for functions from $A^*$ to $Z$, where $d_p$ is now the profinite metric defined by $p$-groups (pro-$p$ metric).

Cite as

Jean-Eric Pin and Pedro V. Silva. A Mahler's theorem for functions from words to integers. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 585-596, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)


Copy BibTex To Clipboard

@InProceedings{pin_et_al:LIPIcs.STACS.2008.1321,
  author =	{Pin, Jean-Eric and Silva, Pedro V.},
  title =	{{A Mahler's theorem for functions from words to integers}},
  booktitle =	{25th International Symposium on Theoretical Aspects of Computer Science},
  pages =	{585--596},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-06-4},
  ISSN =	{1868-8969},
  year =	{2008},
  volume =	{1},
  editor =	{Albers, Susanne and Weil, Pascal},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1321},
  URN =		{urn:nbn:de:0030-drops-13212},
  doi =		{10.4230/LIPIcs.STACS.2008.1321},
  annote =	{Keywords: \$p\$-adic topology, binomial coefficients, Mahler's theorem, \$p\$-group languages}
}
Document
Automata Theory: Infinite Computations (Dagstuhl Seminar 9202)

Authors: Kevin Compton, Jean-Eric Pin, and Wolfgang Thomas

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)


Abstract

Cite as

Kevin Compton, Jean-Eric Pin, and Wolfgang Thomas. Automata Theory: Infinite Computations (Dagstuhl Seminar 9202). Dagstuhl Seminar Report 28, pp. 1-29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (1992)


Copy BibTex To Clipboard

@TechReport{compton_et_al:DagSemRep.28,
  author =	{Compton, Kevin and Pin, Jean-Eric and Thomas, Wolfgang},
  title =	{{Automata Theory: Infinite Computations (Dagstuhl Seminar 9202)}},
  pages =	{1--29},
  ISSN =	{1619-0203},
  year =	{1992},
  type = 	{Dagstuhl Seminar Report},
  number =	{28},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.28},
  URN =		{urn:nbn:de:0030-drops-149166},
  doi =		{10.4230/DagSemRep.28},
}
Document
Automata Theory and Applications in Logic and Complexity (Dagstuhl Seminar 9103)

Authors: Jean Berstel, Jean-Eric Pin, and Wolgang Thoma

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)


Abstract

Cite as

Jean Berstel, Jean-Eric Pin, and Wolgang Thoma. Automata Theory and Applications in Logic and Complexity (Dagstuhl Seminar 9103). Dagstuhl Seminar Report 5, pp. 1-24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (1991)


Copy BibTex To Clipboard

@TechReport{berstel_et_al:DagSemRep.5,
  author =	{Berstel, Jean and Pin, Jean-Eric and Thoma, Wolgang},
  title =	{{Automata Theory and Applications in Logic and Complexity (Dagstuhl Seminar 9103)}},
  pages =	{1--24},
  ISSN =	{1619-0203},
  year =	{1991},
  type = 	{Dagstuhl Seminar Report},
  number =	{5},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.5},
  URN =		{urn:nbn:de:0030-drops-148935},
  doi =		{10.4230/DagSemRep.5},
}
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