Related papers: Most Complex Regular Ideal Languages

We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…

Given a right ideal $I$ in a ring $R$, the idealizer of $I$ in $R$ is the largest subring of $R$ in which $I$ becomes a two-sided ideal. In this paper we consider idealizers in the second Weyl algebra $A_2$, which is the ring of…

A ringoid is a set with two binary operations that are linked by the distributive laws. We study special classes of ringoids that are congruence-simple or ideal-simple. In particular, we examine generalised parasemifields and…

In this thesis, we study the place of regular languages within the communication complexity setting. In particular, we are interested in the non-deterministic communication complexity of regular languages. We show that a regular language…

The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Buchi, regular languages have been classified according to their descriptive complexity, i.e. the type of logical…

Among Zellig Harris's numerous contributions to linguistics his theory of the sublanguages of science probably ranks among the most underrated. However, not only has this theory led to some exhaustive and meaningful applications in the…

The complexity of an infinite word can be measured in several ways, the two most common measures being the subword complexity and the abelian complexity. In 2015, Rigo and Salimov introduced a family of intermediate complexities indexed by…

In this paper, we view the collection of ideals of a commutative principal ideal ring from two perspectives: one as an ordered semigroup I(R) and the other as a category I_R . It is shown that I(R) is a regular ordered semigroup whereas I_R…

The permutation language $P_n$ consists of all words that are permutations of a fixed alphabet of size $n$. Using divide-and-conquer, we construct a regular expression $R_n$ that specifies $P_n$. We then give explicit bounds for the length…

We investigate the structure of ideals generated by binomials (polynomials with at most two terms) and the schemes and varieties associated to them. The class of binomial ideals contains many classical examples from algebraic geometry, and…

We solve an open problem concerning syntactic complexity: We prove that the cardinality of the syntactic semigroup of a suffix-free language with $n$ left quotients (that is, with state complexity $n$) is at most $(n-1)^{n-2}+n-2$ for $n\ge…

We study density of rational languages under shift invariant probability measures on spaces of two-sided infinite words, which generalizes the classical notion of density studied in formal languages and automata theory. The density for a…

We extend classical theorems of Renyi by finding the distributions of the numbers of both weak and strong left-to-right maxima (a.k.a. outstanding elements) in words over a given alphabet and in permutations of a given multiset.

Let R be a Stanley-Reisner ring (that is, a reduced monomial ring) with coefficients in a domain k, and K its associated simplicial complex. Also let D_k(R) be the ring of k-linear differential operators on R. We give two different…

The automatic complexity of a finite word (string) is an analogue for finite automata of Sipser's distinguishing complexity (1983) and was introduced by Shallit and Wang (2001). For a finite alphabet $\Sigma$ of at least two elements, we…

We prove lower bounds on the length of regular expressions for finite languages by methods from arithmetic circuit complexity. First, we show a reduction: the length of a regular expression for a language $L\subseteq \{0,1\}^n$ is bounded…

The state complexity, respectively, nondeterministic state complexity of a regular language $L$ is the number of states of the minimal deterministic, respectively, of a minimal nondeterministic finite automaton for $L$. Some of the most…

Let $I$ be a monomial ideal in a polynomial ring $S=K[x_1,\ldots,x_n]$ over a field $K$ with $n=2$ or $3$, and let $\overline{I}$ be its integral closure. We will show that $\text{reg} (\overline{I}) \le \text{reg} (I)$. Furthermore, if $I$…

We show that a compact complex parallelisable nilmanifold has unobstructed deformations if and only if its associated Lie algebra satisfies a reality condition and is a free Lie algebra in a variety of Lie algebras, that is, defined by a…

Many classical ring-theoretic results state that an ideal that is maximal with respect to satisfying a special property must be prime. We present a "Prime Ideal Principle" that gives a uniform method of proving such facts, generalizing the…