Jean-Éric Pin

Theor. Comput. Sci., 2025

2024

Preface.

[BibT_eX]

[DOI]

Miroslav Ciric

Manfred Droste

Inf. Comput., 2024

2022

Shuffle Product of Regular Languages: Results and Open Problems.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics - 9th International Conference, 2022

2021

Finite automata.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Automata Theory., 2021

2020

How to Prove that a Language Is Regular or Star-Free?

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2020

2019

Languages and formations generated by D4 and Q8.

[BibT_eX]

[DOI]

Xaro Soler-Escrivà

Theor. Comput. Sci., 2019

Newton series, coinductively: a comparative study of composition.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2019

A Mahler's Theorem for Word Functions.

[BibT_eX]

[DOI]

Christophe Reutenauer

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

A survey on difference hierarchies of regular languages.

[BibT_eX]

[DOI]

Olivier Carton

Log. Methods Comput. Sci., 2018

Inequalities for One-Step Products.

[BibT_eX]

[DOI]

Mário J. J. Branco

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

2017

On uniformly continuous functions for some profinite topologies.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Preface.

[BibT_eX]

[DOI]

Andrei A. Bulatov

Edward A. Hirsch

Theory Comput. Syst., 2017

The EATCS Award 2018 - Call for Nominations.

[BibT_eX]

[DOI]

Christos H. Papadimitriou

Bull. EATCS, 2017

The EATCS Award 2017 - Laudatio for Eva Tardos.

[BibT_eX]

[DOI]

Fedor V. Fomin

Bull. EATCS, 2017

Commutative Positive Varieties of Languages.

[BibT_eX]

[DOI]

Jorge Almeida

Zoltán Ésik

Acta Cybern., 2017

Some Results of Zoltán Ésik on Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

The Dot-Depth Hierarchy, 45 Years Later.

[BibT_eX]

[DOI]

Proceedings of the Role of Theory in Computer Science, 2017

Open Problems About Regular Languages, 35 Years Later.

[BibT_eX]

[DOI]

Proceedings of the Role of Theory in Computer Science, 2017

Dual Space of a Lattice as the Completion of a Pervin Space - Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the Relational and Algebraic Methods in Computer Science, 2017

2016

Ultrafilters on words for a fragment of logic.

[BibT_eX]

[DOI]

Andreas Krebs

Theor. Comput. Sci., 2016

Varieties of Cost Functions.

[BibT_eX]

[DOI]

Laure Daviaud

Denis Kuperberg

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

2015

On fixed points of the lower set operator.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2015

Newton Series, Coinductively.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing - ICTAC 2015, 2015

Newton's Forward Difference Equation for Functions from Words to Words.

[BibT_eX]

[DOI]

Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014

A noncommutative extension of Mahler's theorem on interpolation series.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

From Ultrafilters on Words to the Expressive Power of a Fragment of Logic.

[BibT_eX]

[DOI]

Andreas Krebs

Proceedings of the Descriptional Complexity of Formal Systems, 2014

2013

Regular languages and partial commutations.

[BibT_eX]

[DOI]

Giovanna Guaiana

Inf. Comput., 2013

Duality in Computer Science (Dagstuhl Seminar 13311).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2013

An Explicit Formula for the Intersection of Two Polynomials of Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2011

On Profinite Uniform Structures Defined by Varieties of Finite Monoids.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2011

Theme and Variations on the Concatenation Product.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics - 4th International Conference, 2011

Equational descriptions of languages.

[BibT_eX]

Proceedings of the Automata and Formal Languages, 13th International Conference, 2011

2010

The expressive power of the shuffle product.

[BibT_eX]

[DOI]

Inf. Comput., 2010

A Topological Approach to Recognition.

[BibT_eX]

[DOI]

Serge Grigorieff

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

10501 Executive Summary - Advances and Applications of Automata on Words and Trees.

[BibT_eX]

[DOI]

Proceedings of the Advances and Applications of Automata on Words and Trees, 12.12., 2010

10501 Abstracts Collection - Advances and Applications of Automata on Words and Trees.

[BibT_eX]

[DOI]

Proceedings of the Advances and Applications of Automata on Words and Trees, 12.12., 2010

2009

Languages Recognized by Finite Supersoluble Groups.

[BibT_eX]

[DOI]

Olivier Carton

Xaro Soler-Escrivà

J. Autom. Lang. Comb., 2009

Profinite Methods in Automata Theory.

[BibT_eX]

[DOI]

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Equations Defining the Polynomial Closure of a Lattice of Regular Languages.

[BibT_eX]

[DOI]

Mário J. J. Branco

Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2008

A Mahler's theorem for functions from words to integers.

[BibT_eX]

[DOI]

Proceedings of the STACS 2008, 2008

A Robust Class of Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

When Does Partial Commutative Closure Preserve Regularity?

[BibT_eX]

[DOI]

Giovanna Guaiana

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Duality and Equational Theory of Regular Languages.

[BibT_eX]

[DOI]

Serge Grigorieff

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Automata and semigroups recognizing infinite words.

[BibT_eX]

Olivier Carton

Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2006

Actions, wreath products of C-varieties and concatenation product.

[BibT_eX]

[DOI]

Laura Chaubard

Theor. Comput. Sci., 2006

Operations preserving regular languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

First Order Formulas with Modular Predicates.

[BibT_eX]

[DOI]

Laura Chaubard

Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

Varieties Generated by Certain Models of Reversible Finite Automata.

[BibT_eX]

[DOI]

Marats Golovkins

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005

A topological approach to transductions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Some results on C-varieties.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2005

Expressive power of existential first-order sentences of Bu"chi's sequential calculus.

[BibT_eX]

[DOI]

Discret. Math., 2005

2004

Shuffle on positive varieties of languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Words Guaranteeing Minimum Image.

[BibT_eX]

[DOI]

Mikhail V. Volkov

Int. J. Found. Comput. Sci., 2004

The Consequences of Imre Simon's Work in the Theory of Automata, Languages, and Semigroups.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Infinite words - automata, semigroups, logic and games.

[BibT_eX]

Pure and applied mathematics series 141, Elsevier Morgan Kaufmann, ISBN: 978-0-12-532111-2, 2004

2003

Algebraic tools for the concatenation product.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Foreword.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Operations Preserving Recognizable Languages.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

On a Conjecture of Schnoebelen.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2001

A conjecture on the concatenation product.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2001

Logic on Words.

[BibT_eX]

Proceedings of the Current Trends in Theoretical Computer Science, 2001

2000

Words Guaranteeing Minimal Image.

[BibT_eX]

Mikhail V. Volkov

Proceedings of the International Colloquium on Words, 2000

1999

Uniformities on Free Semigroups.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 1999

Marcel-Paul Schützenberger (1920-1996).

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 1999

1998

Positive Varieties and Infinite Words.

[BibT_eX]

[DOI]

Proceedings of the LATIN '98: Theoretical Informatics, 1998

Bridges for Concatenation Hierarchies.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997

Syntactic Semigroups.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Formal Languages, Volume 1: Word, Language, Grammar., 1997

Ponynominal Closure and Unambiguous Product.

[BibT_eX]

[DOI]

Theory Comput. Syst., 1997

1996

Local Languages and the Berry-Sethi Algorithm.

[BibT_eX]

[DOI]

Jean Berstel

Theor. Comput. Sci., 1996

Logic, Semigroups and Automata on Words.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 1996

The Expressive Power of Existential First Order Sentences of Büchi's Sequential Calculus.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

1995

Linearizing Some Recursive Logic Programs.

[BibT_eX]

[DOI]

Irène Guessarian

IEEE Trans. Knowl. Data Eng., 1995

A Negative Answer to a Question of Wilke on Varieties of \omega-Languages.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

Polynomial Closure and Unambiguous Product.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

1994

Logic on Words.

[BibT_eX]

Bull. EATCS, 1994

Polynomial Closure of Group Languages and Open Sets of the Hall Topology.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993

On the Expressive Power of Temporal Logic.

[BibT_eX]

[DOI]

Joëlle Cohen

J. Comput. Syst. Sci., 1993

The Bideterministic Concatenation Product.

[BibT_eX]

[DOI]

Denis Thérien

Int. J. Algebra Comput., 1993

A Graphic Language Based on Timing Diagrams.

[BibT_eX]

[DOI]

Christian Antoine

Bernard Le Goff

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993

1992

Some Results on the Generalized Star-Height Problem

[BibT_eX]

[DOI]

Denis Thérien

Inf. Comput., December, 1992

On Reversible Automata.

[BibT_eX]

[DOI]

Proceedings of the LATIN '92, 1992

1991

Languages and Scanners.

[BibT_eX]

[DOI]

Danièle Beauquier

Theor. Comput. Sci., 1991

Semigroups with Idempotent stabilizers and Applications to Automata Theory.

[BibT_eX]

[DOI]

Bertrand Le Saëc

Int. J. Algebra Comput., 1991

Ash's Type II Theorem, Profinite Topology and Malcev Products: Part I.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 1991

A Purely Algebraic Proof of McNaughton's Theorem on Infinite Words.

[BibT_eX]

[DOI]

Bertrand Le Saëc

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991

1990

On the Varieties of Languages Associated with Some Varieties of Finite Monoids with Commuting Idempotents

[BibT_eX]

[DOI]

Christopher J. Ash

Thomas Eric Hall

Inf. Comput., May, 1990

1989

Thue-Morse sequence and p-adic topology for the free monoid.

[BibT_eX]

[DOI]

Jean Berstel

Maxime Crochemore

Discret. Math., 1989

A maxmin problem on finite automata.

[BibT_eX]

[DOI]

Jean-Marc Champarnaud

Discret. Appl. Math., 1989

New Results on the Generalized Star-Height Problem.

[BibT_eX]

[DOI]

Denis Thérien

Proceedings of the STACS 89, 1989

Factors of Words.

[BibT_eX]

[DOI]

Danièle Beauquier

Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

1988

Relational morphisms, transductions and operations on languages.

[BibT_eX]

[DOI]

Proceedings of the Formal Properties of Finite Automata and Applications, 1988

1987

On the Language Accepted by Finite Reversible Automata.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986

First-Order Logic and Star-Free Sets.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1986

1985

Une Application de la Representation Matricielle des Transductions.

[BibT_eX]

[DOI]

Jacques Sakarovitch

Theor. Comput. Sci., 1985

Finite Group Topology and p-Adic Topology for Free Monoids.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1985

Products of group languages.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1985

1984

Hiérarchies de Concaténation.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1984

Star free omega-languages and first order logic.

[BibT_eX]

[DOI]

Proceedings of the Automata on Infinite Words, 1984

Languages and Inverse Semigroups.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1984

1983

Some operations and transductions that preserve rationality.

[BibT_eX]

[DOI]

Jacques Sakarovitch

Proceedings of the Theoretical Computer Science, 1983

Arbres et Hierarchies de Concatenation.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1983

1982

A Note on the Triangle Conjecture.

[BibT_eX]

[DOI]

Imre Simon

J. Comb. Theory A, 1982

1981

Un analogue du théorème des variétés pour les cones et les cylindres.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 1981

Languages reconnaissables et codage prefixe pur.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1981

1980

Proprietes syntactiques du produit non ambigu.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1980

1979

Une caractérisation de trois variétés de langages bien connues.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 1979

1978

Sur le Monoide Syntactique de L* Lorsque L est un Langage Fini.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1978

Sur les mots synthronisants dans un automate fini.

[BibT_eX]

J. Inf. Process. Cybern., 1978

Sur un Cas Particulier de la Conjecture de Cerny.

[BibT_eX]

[DOI]