§ INTRODUCTION

§ PRELIMINARIES

§ STAR-FREE CLOSURE

§ BOUNDED SYNCHRONIZATION DELAY

§ ALGEBRAIC CHARACTERIZATION

§ FIRST LOGICAL CHARACTERIZATION: FIRST-ORDER LOGIC

§ SECOND LOGICAL CHARACTERIZATION: LINEAR TEMPORAL LOGIC

§ COVERING FOR FINITE INPUT CLASSES

§ COVERING FOR GROUP INPUT CLASSES

§ CONCLUSION

Missing 'biblatex' package
The bibliography requires the 'biblatex' package.

journaltitleThe Journal of Symbolic Logic
titleUndecidability of the Identity Problem for Finite Semigroups

journaltitlePublicationes Mathematicae Debrecen
titleSome Algorithmic Problems for Pseudovarieties

journaltitleInternational Journal of Algebra and Computation
titleInevitable Graphs: a Proof of the Type II Conjecture and some Related Decision Procedures

journaltitleJournal of Computer and System Sciences
titleRegular languages in NC1

Cambridge University Press

seriesEncyclopedia of Mathematics and its Applications
titleCodes and Automata

booktitleProceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS'06)
titleFirst Order Formulas with Modular Predicates

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

titleTwo-variable first order logic with modular predicates over words

journaltitleSemigroup Forum
titleAbelian Poinlikes of a Monoid

journaltitleTheory Comput. Syst.
titleOmega-Rational Expressions with Bounded Synchronization Delay

booktitleProceedings of the 43rd International Colloquium on Automata, Languages, and Programming
titleCharacterizing classes of regular languages using prefix codes of bounded synchronization delay

titleCharacterizing classes of regular languages using prefix codes of bounded synchronization delay

Orlando, FL, USA

Academic Press, Inc.

titleAutomata, Languages, and Machines

titleSatisfiability and Model Checking for MSO-Definable Temporal Logics Are in PSPACE

journaltitleTheory of Computing Systems
titleLanguages of Dot-Depth 3/2

journaltitleJournal of Pure Applied Algebra
titlePointlike sets: the finest aperiodic cover of a finite semigroup

World Scientific Publishing

journaltitleInternational Journal of Algebra and Computation
titleAsh's type II theorem, profinite topology and Malcev products

Computer Science Department, University of California at Los Angeles, USA

titleTense Logic and the Theory of Linear Order
typePhD thesis

journaltitleSemigroup Forum
titleDecidability of complexity one-half for finite semigroups

EDP Sciences

journaltitleRAIRO - Theoretical Informatics and Applications
titleA Semigroup Characterization of Dot-Depth One Languages

journaltitleLogical Methods in Computer Science
titleTwo-variable logics with some betweenness relations: Expressiveness, satisfiability and membership
volumeVolume 16, Issue 3

journaltitleRAIRO - Theoretical Informatics and Applications
titleOne Quantifier Alternation in First-Order Logic with Modular Predicates

booktitleFCT Conference
titleProduct of Group Languages

MIT Press

titleCounter-Free Automata

Berlin, Heidelberg

booktitleProceedings of the 25th International Colloquium on Automata, Languages and Programming
titleBridges for Concatenation Hierarchies

noteIn preparation
titleMathematical Foundations of Automata Theory

Kluwer academic

journaltitleNATO Advanced Study Institute, Semigroups, Formal Languages and Groups
titlePG = BG, a success story

World Scientific

booktitleThe Role of Theory in Computer Science. Essays Dedicated to Janusz Brzozowski
titleThe dot-depth hierarchy, 45 years later

journaltitleJournal of Pure and Applied Algebra
titleLocally trivial categories and unambiguous concatenation

Berlin, Heidelberg

journaltitleTheory of Computing Systems
titlePolynomial Closure and Unambiguous Product

journaltitleLogical Methods in Computer Science
titleSeparating regular languages with two quantifier alternations

titleAll about unambiguous polynomial closure

journaltitleTheory of Computing Systems (ToCS)
noteSelected papers from CSR'17
titleGeneric results for concatenation hierarchies

booktitleProceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS'23
titleGroup separation strikes back

booktitleProceedings of the 46th International Colloquium on Automata, Languages, and Programming
titleOn All Things Star-Free

journaltitleLogical Methods in Computer Science
titleSeparating Regular Languages with First-Order Logic

New York, NY, USA

booktitleProceedings of the Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic (CSL'14) and the 29th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'14)
titleSeparating Regular Languages with First-order Logic

booktitleProceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science
titleSeparation and covering for group based concatenation hierarchies

journaltitleLogical Methods in Computer Science
titleSeparation for dot-depth two
volumeVolume 17, Issue 3

journaltitleLogical Methods in Computer Science
titleThe Covering Problem

journaltitleInformation and Control
titleOn Finite Monoids Having Only Trivial Subgroups

Academic Press

journaltitleSymposia Mathematica
noteConvegno di Informatica Teorica, INDAM, Roma, 1973
titleSur certaines opérations de fermeture dans les langages rationnels

Berlin, Heidelberg

booktitleProceedings of the 2nd GI Conference on Automata Theory and Formal Languages
titlePiecewise Testable Events

journaltitleTheoretical Computer Science
titleA Generalization of the Schützenberger Product of Finite Monoids

journaltitleJournal of Pure and Applied Algebra
titleAperiodic homomorphisms and the concatenation product of recognizable sets

booktitleLATIN 2002: Theoretical Informatics, 5th Latin American Symposium
titleOn Logical Descriptions of Regular Languages

European Mathematical Society Publishing House, Zürich, Switzerland

booktitleHandbook of Automata Theory

journaltitleTheoretical Computer Science
titleClassification of Finite Monoids: The Language Approach

New York, NY, USA

booktitleProceedings of the 30th Annual ACM Symposium on Theory of Computing
titleOver Words, Two Variables Are As Powerful As One Quantifier Alternation

journaltitleTheory of Computing Systems
titlePermutation automata

Berlin, Heidelberg

booktitleProceedings of the 16th Annual Conference on Theoretical Aspects of Computer Science
titleClassifying Discrete Temporal Properties

Missing 'biblatex' package
The bibliography requires the 'biblatex' package.

journaltitleThe Journal of Symbolic Logic
titleUndecidability of the Identity Problem for Finite Semigroups

journaltitlePublicationes Mathematicae Debrecen
titleSome Algorithmic Problems for Pseudovarieties

journaltitleInternational Journal of Algebra and Computation
titleInevitable Graphs: a Proof of the Type II Conjecture and some Related Decision Procedures

journaltitleJournal of Computer and System Sciences
titleRegular languages in NC1

Cambridge University Press

seriesEncyclopedia of Mathematics and its Applications
titleCodes and Automata

booktitleProceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS'06)
titleFirst Order Formulas with Modular Predicates

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

titleTwo-variable first order logic with modular predicates over words

journaltitleSemigroup Forum
titleAbelian Poinlikes of a Monoid

journaltitleTheory Comput. Syst.
titleOmega-Rational Expressions with Bounded Synchronization Delay

booktitleProceedings of the 43rd International Colloquium on Automata, Languages, and Programming
titleCharacterizing classes of regular languages using prefix codes of bounded synchronization delay

titleCharacterizing classes of regular languages using prefix codes of bounded synchronization delay

Orlando, FL, USA

Academic Press, Inc.

titleAutomata, Languages, and Machines

titleSatisfiability and Model Checking for MSO-Definable Temporal Logics Are in PSPACE

journaltitleTheory of Computing Systems
titleLanguages of Dot-Depth 3/2

journaltitleJournal of Pure Applied Algebra
titlePointlike sets: the finest aperiodic cover of a finite semigroup

World Scientific Publishing

journaltitleInternational Journal of Algebra and Computation
titleAsh's type II theorem, profinite topology and Malcev products

Computer Science Department, University of California at Los Angeles, USA

titleTense Logic and the Theory of Linear Order
typePhD thesis

journaltitleSemigroup Forum
titleDecidability of complexity one-half for finite semigroups

EDP Sciences

journaltitleRAIRO - Theoretical Informatics and Applications
titleA Semigroup Characterization of Dot-Depth One Languages

journaltitleLogical Methods in Computer Science
titleTwo-variable logics with some betweenness relations: Expressiveness, satisfiability and membership
volumeVolume 16, Issue 3

journaltitleRAIRO - Theoretical Informatics and Applications
titleOne Quantifier Alternation in First-Order Logic with Modular Predicates

booktitleFCT Conference
titleProduct of Group Languages

MIT Press

titleCounter-Free Automata

Berlin, Heidelberg

booktitleProceedings of the 25th International Colloquium on Automata, Languages and Programming
titleBridges for Concatenation Hierarchies

noteIn preparation
titleMathematical Foundations of Automata Theory

Kluwer academic

journaltitleNATO Advanced Study Institute, Semigroups, Formal Languages and Groups
titlePG = BG, a success story

World Scientific

booktitleThe Role of Theory in Computer Science. Essays Dedicated to Janusz Brzozowski
titleThe dot-depth hierarchy, 45 years later

journaltitleJournal of Pure and Applied Algebra
titleLocally trivial categories and unambiguous concatenation

Berlin, Heidelberg

journaltitleTheory of Computing Systems
titlePolynomial Closure and Unambiguous Product

journaltitleLogical Methods in Computer Science
titleSeparating regular languages with two quantifier alternations

titleAll about unambiguous polynomial closure

journaltitleTheory of Computing Systems (ToCS)
noteSelected papers from CSR'17
titleGeneric results for concatenation hierarchies

booktitleProceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS'23
titleGroup separation strikes back

booktitleProceedings of the 46th International Colloquium on Automata, Languages, and Programming
titleOn All Things Star-Free

journaltitleLogical Methods in Computer Science
titleSeparating Regular Languages with First-Order Logic

New York, NY, USA

booktitleProceedings of the Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic (CSL'14) and the 29th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'14)
titleSeparating Regular Languages with First-order Logic

booktitleProceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science
titleSeparation and covering for group based concatenation hierarchies

journaltitleLogical Methods in Computer Science
titleSeparation for dot-depth two
volumeVolume 17, Issue 3

journaltitleLogical Methods in Computer Science
titleThe Covering Problem

journaltitleInformation and Control
titleOn Finite Monoids Having Only Trivial Subgroups

Academic Press

journaltitleSymposia Mathematica
noteConvegno di Informatica Teorica, INDAM, Roma, 1973
titleSur certaines opérations de fermeture dans les langages rationnels

Berlin, Heidelberg

booktitleProceedings of the 2nd GI Conference on Automata Theory and Formal Languages
titlePiecewise Testable Events

journaltitleTheoretical Computer Science
titleA Generalization of the Schützenberger Product of Finite Monoids

journaltitleJournal of Pure and Applied Algebra
titleAperiodic homomorphisms and the concatenation product of recognizable sets

booktitleLATIN 2002: Theoretical Informatics, 5th Latin American Symposium
titleOn Logical Descriptions of Regular Languages

European Mathematical Society Publishing House, Zürich, Switzerland

booktitleHandbook of Automata Theory

journaltitleTheoretical Computer Science
titleClassification of Finite Monoids: The Language Approach

New York, NY, USA

booktitleProceedings of the 30th Annual ACM Symposium on Theory of Computing
titleOver Words, Two Variables Are As Powerful As One Quantifier Alternation

journaltitleTheory of Computing Systems
titlePermutation automata

Berlin, Heidelberg

booktitleProceedings of the 16th Annual Conference on Theoretical Aspects of Computer Science
titleClassifying Discrete Temporal Properties