Related papers: Most Complex Regular Ideal Languages

We study the syntactic complexity of finite/cofinite, definite and reverse definite languages. The syntactic complexity of a class of languages is defined as the maximal size of syntactic semigroups of languages from the class, taken as a…

The goal of the present paper is to provide a systematic and comprehensive study of rational stochastic languages over a semiring K \in {Q, Q +, R, R+}. A rational stochastic language is a probability distribution over a free monoid…

The main result is that the only non trivial closed ideal in the Banach algebra $L(L^p)$ of bounded linear operators on $L^p(0,1)$, $1\le p < \infty$, that has a left approximate identity is the ideal of compact operators. The algebra…

The question of integer complexity asks about the minimal number of $1$'s that are needed to express a positive integer using only addition and multiplication (and parentheses). In this paper, we propose the notion of $l$-complexity of…

We show that every Lie ideal in a unital, properly infinite C*-algebra is commutator equivalent to a unique two-sided ideal. It follows that the Lie ideal structure of such a C*-algebra is concisely encoded by its lattice of two-sided…

A language L is prefix-closed if, whenever a word w is in L, then every prefix of w is also in L. We define suffix-, factor-, and subword-closed languages in the same way, where by subword we mean subsequence. We study the quotient…

Let $Q$ be an inverse semigroup. A subsemigroup $S$ of $Q$ is a left I-order in $Q$ and $Q$ is a semigroup of left I-quotients of $S$ if every element in $Q$ can be written as $a^{-1}b$, where $a, b \in S$ and $a^{-1}$ is the inverse of $a$…

The subword complexity of a finite word $w$ of length $N$ is a function which associates to each $n\le N$ the number of all distinct subwords of $w$ having the length $n$. We define the \emph{maximal complexity} C(w) as the maximum of the…

In the constrained synchronization problem we ask if a given automaton admits a synchronizing word coming from a fixed regular constraint language. We show that intersecting a given constraint language with an ideal language decreases the…

Normal forms for logic programs under stable/answer set semantics are introduced. We argue that these forms can simplify the study of program properties, mainly consistency. The first normal form, called the {\em kernel} of the program, is…

For an arbitrary ring $R$, the largest strong left quotient ring $Q_l^s(R)$ of $R$ and the strong left localization radical $\glsR$ are introduced and their properties are studied in detail. In particular, it is proved that…

This paper is about the local geometry of a real surfaces. It introduces machinery for studying families of subsets which are determined by conditions which are similar to base conditions, but also involve positivity/non-negativity. The…

The tight upper bound on the state complexity of the reverse of R-trivial and J-trivial regular languages of the state complexity n is 2^{n-1}. The witness is ternary for R-trivial regular languages and (n-1)-ary for J-trivial regular…

Let $S$ be a polynomial ring in $n$ variables over a field. Let $I$ be a homogeneous ideal in $S$ generated by forms of degree at most $d$ with $\text{dim}(S/I)=r$. In the first part of this paper, we show how to derive from a result of Hoa…

In classical and real algebraic geometry there are several notions of the radical of an ideal I. There is the vanishing radical defined as the set of all real polynomials vanishing on the real zero set of I, and the real radical defined as…

We propose the Transcendental Encoding Conjecture for decision problems, which asserts that every language in complexity class P encodes to an algebraic real (possibly rational or algebraic irrational) under its binary characteristic…

The height of a piecewise-testable language $L$ is the maximum length of the words needed to define $L$ by excluding and requiring given subwords. The height of $L$ is an important descriptive complexity measure that has not yet been…

We prove that a Lie nilpotent one-sided ideal of an associative ring $R$ is contained in a Lie solvable two-sided ideal of $R$. An estimation of derived length of such Lie solvable ideal is obtained depending on the class of Lie nilpotency…

We study a model of one-way quantum automaton where only measurement operations are allowed ($\mon$). We give an algebraic characterization of $\lmo(\Sigma)$, showing that the syntactic monoids of the languages in $\lmo(\Sigma)$ are exactly…

An ideal is a classical object of study in the field of algebraic number theory. In maximal quadratic orders of number fields, ideals usually represented by the $\mathbb Z$-basis. This form of representation is used in most of the…