Syntactic Semigroups

@inproceedings{Pin1997SyntacticS,
  title={Syntactic Semigroups},
  author={Jean-{\'E}ric Pin},
  booktitle={Handbook of Formal Languages},
  year={1997}
}
  • J. Pin
  • Published in Handbook of Formal Languages 1 April 1997
  • Economics
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou… 
Syntactic Semiring of a Language
TLDR
Pin's refinement of Eilenberg theorem gives a one-to-one correspondence between positive varieties of rational languages and pseudovarieties of ordered monoids.
A combinatorial approach to the separation problem for regular languages. (Une approche combinatoire du problème de séparation pour les langages réguliers)
TLDR
This thesis provides a generic approach, based on combinatorial arguments, to proving the decidability of the separation problem for several subclasses of the regular languages, including the classes of piecewise testable languages, unambiguous languages, and locally (threshold) testable Languages.
Well quasi-orders arising from finite ordered semigroups
In 1985, Bucher, Ehrenfeucht and Haussler studied derivation relations associated with a given set of context-free rules. Their research motivated a question regarding homomorphisms from the
Syntactic semigroup problem for the semigroup reducts of Affine Near-semirings over Brandt Semigroups
TLDR
This work investigates the syntactic semigroup problem for both the semigroup reducts of A+(B n), the affine near-semiring over a Brandt semigroup Bn.
A Robust Class of Regular Languages
TLDR
This survey paper presents known results and open questions on a proper subclass of the class of regular languages, denoted by $\mathcal{W}$, and proposes as a challenge to find a constructive description and a logical characterization of this class.
Bridges for Concatenation Hierarchies
TLDR
This article solves positively a question raised in 1985 about concatenation hierarchies of rational languages, which are constructed by alternating boolean operations and concate-nation products, and establishes a simple algebraic connection between the Straubing-Therien hierarchy and the group hierarchy.
Algebraic classifications of regular tree languages
We review several algebraic formalisms used for characterizing families of regular tree languages. A theory based on syntactic algebras and varieties of congruences is presented in detail, including
A positive extension of Eilenberg’s variety theorem for non-regular languages
TLDR
This paper introduces the so-called positively typed monoids, and gives a correspondence between varieties of such algebraic structures and positive varieties of possibly non-regular languages.
Proving that a Tree Language is not First-Order Definable
TLDR
It is shown that a recursive proof exists for the syntactic algebra of every non-definable language and an algebra of mappings and an extended algebra is defined, which is used to redefine the notion of aperiodicity in a way that generalizes the existing ones.
...
...

References

SHOWING 1-10 OF 401 REFERENCES
Profinite Semigroups, Mal'cev Products, and Identities☆
Abstract We compute a set of identities defining the Mal'cev product of pseudovarieties of finite semigroups or finite ordered semigroups. We also characterize the pointlike subsets of a finite
A Semigroup Characterization of Dot-Depth one Languages
  • Robert Knast
  • Mathematics, Computer Science
    RAIRO Theor. Informatics Appl.
  • 1983
TLDR
It is shown that one can décide whether a langage has dot-depth one in thedot-depth hierarchy introduced by BrzozowskL based on an algebraic characterization of the syntactic semigroup of a langages of dot- depth 0 or 1.
Relationals Morphisms and Operations on Recognizable Sets
. — Relational morphisms betweenfinite monoids (a notion due to Tilson) are used to study the effect certain opérations on recognizabie sets have on the syntactic monoids ofthose sets. This leads to
Sur les monoïdes finis dont les groupes sont commutatifs
TLDR
L’accès aux archives de la revue « Revue française d’automatique informatique recherche opérationnelle • Informatique théorique » implique l’ Accord avec les conditions générales d‘utilisation.
Sur le Monoide Syntactique de L* Lorsque L est un Langage Fini
  • J. Pin
  • Computer Science, Mathematics
    Theor. Comput. Sci.
  • 1978
On dot-depth two
Etant donnes des entiers positifs m1, …, mk, on definit des congruences ~(m1, …, mk) en relation avec une version du jeu de Ehrenfeucht-Fraisse, et qui correspondent au niveau k de la hierarchie de
On Some Properties of the Syntactic Semigroup of a Very Pure Subsemigroup
  • A. Luca
  • Mathematics
    RAIRO Theor. Informatics Appl.
  • 1980
— Some synchronizing properties of"very pure" subsemigroups ofafree semigroup are shown by means of an analysis of the properties of their syntactic semigroups. Résumé. — On démontre certaines
Algebraic and Topological Theory of Languages
  • J. Rhodes, P. Weil
  • Mathematics, Computer Science
    RAIRO Theor. Informatics Appl.
  • 1995
TLDR
Nous generalisons les theoremes sur les langages rationnels de Kleene, Schutzenberger and Straubing pour decrire les classes des langages de torsion, deTorsion bornee, aperiodiques et aperiodique bornes.
Varieties of Finite Categories
TLDR
The main goal is to point out the similarities and distinctions between C-varieties and varieties of finite monoids that underlie the more traditional approach to the theory.
...
...