Related papers: On The Structure of Dyck Languages
Using the formalism of toric varieties, we describe how to make a monomial application algebraically stable.
We consider finite trees with edges labeled by letters on a finite alphabet $\varSigma$. Each pair of nodes defines a unique labeled path whose trace is a word of the free monoid $\varSigma^*$. The set of all such words defines the language…
The classic Mckay correspondence gives a connection between finite subgroups of $\operatorname{SU}(2)$ and the simply-laced Dynkin diagrams. In this article, a direct proof is presented. The bipartite structure of the Mckay diagrams is…
In this paper we prove that one-sided Duo rings are (two-sided) McCoy. By doing so, we are then able to explicitly describe some of these ring element annihilators of polynomials in McCoy rings. We conclude the paper by showing the place of…
In this work, we introduce a new notion for representing graph classes with formal languages. In contrast to the seminal work by Kitaev and Pyatkin to represent graphs by words, we use formal binary languages in order to have a set of…
We survey results devoted to the lattice of varieties of monoids. Along with known results, some unpublished results are given with proofs. A number of open questions and problems are also formulated.
A transduction provides us with a way of using the monadic second-order language of a structure to make statements about a derived structure. Any transduction induces a relation on the set of these structures. This article presents a…
In this paper, we extend the notion of Lyndon word to transfinite words. We prove two main results. We first show that, given a transfinite word, there exists a unique factorization in Lyndon words that are densely non-increasing, a…
We revisit the notion of one-sided recognizability of morphisms and its relation to two-sided recognizability.
Any finite conversation can be rationalized.
We present an example of two countable $\omega$-categorical structures, one of which has a finite relational language, whose endomorphism monoids are isomorphic as abstract monoids, but not as topological monoids -- in other words, no…
We establish an Ando-type dilation theorem for a pair of commuting contractions together with a representation of a right LCM monoid via either the Cartesian or the free product. We prove that if each individual contraction together with…
We present examples of closed subsets of a free group such that their product is not closed in the profinite topology. We discuss how to characterize a subset of a free group which is closed in the profinite topology and its product with…
For a given finite group $G$ consisting of morphisms and antimorphisms of a free monoid $\mathcal{A}^*$, we study infinite words with language closed under the group $G$. We focus on the notion of $G$-richness which describes words rich in…
Building on work of Brandt and Terao in their study of $k$-formality, we introduce a co-chain complex associated to a multi-arrangement and prove that its cohomologies determine freeness of the associated module of multi-derivations. This…
We show that any finite monoid or semigroup presentation satisfying the small overlap condition C(4) has word problem which is a deterministic rational relation. It follows that the set of lexicographically minimal words forms a regular…
We consider first-order logic with monoidal quantifiers over words. We show that all languages with a neutral letter, definable using the addition numerical predicate are also definable with the order predicate as the only numerical…
We extend a dichotomy between 1-basedness and supersimplicity proved in a previous paper. The generalization we get is to arbitrary language, with no restrictions on the topology (we do not demand type-definabilty of the open set in the…
We prove that a trace monoid embeds into the queue monoid if and only if it embeds into the direct product of two free monoids. We also give a decidable characterization of these trace monoids.
Eilenberg's variety theorem, a centerpiece of algebraic automata theory, establishes a bijective correspondence between varieties of languages and pseudovarieties of monoids. In the present paper this result is generalized to an abstract…