Related papers: Ordered Monoids: Languages and Relations
Jackson and Lee proved that certain six-element monoid generates a hereditarily finitely based variety $\mathbb E^1$ whose lattice of subvarieties contains an infinite ascending chain. We identify syntactic monoids which generate finitely…
A group is Markov if it admits a prefix-closed regular language of unique representatives with respect to some generating set, and strongly Markov if it admits such a language of unique minimal-length representatives over every generating…
This paper describes infinite sets of polynomial equations in infinitely many variables with the property that the existence of a solution or even an approximate solution for every finite subset of the equations implies the existence of a…
In this paper, we elaborate ring theoretic properties of nodal orders. In particular, we prove that they are closed under taking crossed products with finite groups.
We study the question of whether a given regular language of finite trees can be defined in first-order logic. We develop an algebraic approach to address this question and we use it to derive several necessary and sufficient conditions for…
We establish a relation between fully extended $2$-dimensional TQFTs and recognisable weighted formal languages, rational biprefix codes and lattice TFTs. We show the equivalence of $2D$ closed TFTs and rational exchangeable series and we…
We explore monoids generated by operators on certain infinite partial orders. Our starting point is the work of Fomin and Greene on monoids satisfying the relations $(\u{r}+\u{r+1})\u{r+1}\u{r}=\u{r+1}\u{r}(\u{r}+\u{r+1})$ and…
We examine the problem of projecting subsets of a commutative, positively ordered monoid into an $o$-ideal. We prove that to this end one may restrict to a sufficient subset, for whose cardinality we provide an explicit upper bound. Several…
We present a new method for characterizing the interpretive possibilities generated by elliptical constructions in natural language. Unlike previous analyses, which postulate ambiguity of interpretation or derivation in the full clause…
These notes present an approach to obtaining monoid operations which are compatible with a given family of mappings in the sense that the mappings become left translations in the monoid. This can be applied to various situations such as the…
We define a monoid structure on the set of $k$-equal arrangements and use this structure to define limits of braid arrangements. We compute the cohomology of the associated limits of rational models of the arrangements complex complements.…
We study FO+, a fragment of first-order logic on finite words, where monadic predicates can only appear positively. We show that there is a FO-definable language that is monotone in monadic predicates but not definable in FO+. This provides…
Finitary monads on $\mathsf{Pos}$ are characterized as the precisely the free-algebra monads of varieties of algebras. These are classes of ordered algebras specified by inequations in context. Analagously, finitary enriched monads on…
The fundamentals of formal logic, theory of sets and mathematical structures are narrated in terms of relations language.
In this paper we consider the state complexity of an operation on formal languages, root(L). This naturally entails the discussion of the monoid of transformations of a finite set. We obtain good upper and lower bounds on the state…
In this paper, we investigate the connection between infinite permutation monoids and bimorphism monoids of first-order structures. Taking our lead from the study of automorphism groups of structures as infinite permutation groups and the…
Additive relations are defined over additive monoids and additive operation is introduced over these new relations then we build algebraic system of equations. We can generate profuse equations by additive relations of two variables. To…
We study approximations of theories both in general context and with respect to some natural classes of theories. Some kinds of approximations are considered, connections with finitely axiomatizable theories and minimal generating sets of…
We consider a new kind of interpretation over relational structures: finite sets interpretations. Those interpretations are defined by weak monadic second-order (WMSO) formulas with free set variables. They transform a given structure into…
We define compact automata and show that every language has a unique minimal compact automaton. We also define recognition of languages by compact left semitopological monoids and construct the analogue of the syntactic monoid in this…