Related papers: Most Complex Regular Ideal Languages
We examine the complexity of basic regular operations on languages represented by Boolean and alternating finite automata. We get tight upper bounds m+n and m+n+1 for union, intersection, and difference, 2^m+n and 2^m+n+1 for concatenation,…
Given a finite alphabet $\Sigma$ and a right-infinite word $\bf w$ over $\Sigma$, we define the Lie complexity function $L_{\bf w}:\mathbb{N}\to \mathbb{N}$, whose value at $n$ is the number of conjugacy classes (under cyclic shift) of…
Binomial ideals are special polynomial ideals with many algorithmically and theoretically nice properties. We discuss the problem of deciding if a given polynomial ideal is binomial. While the methods are general, our main motivation and…
We introduce the notions of one-sided dirings, 3-irreducible left modules, 3-primitive left dirings, 3-semi-primitive left dirings, 3-primitive ideals and 3-radicals. The main results consists of two parts. The first part establishes two…
Let $R$ be a finite commutative chain ring, $D_{2n}$ be the dihedral group of size $2n$ and $R[D_{2n}]$ be the dihedral group ring. In this paper, we completely characterize left ideals of $R[D_{2n}]$ (called left $D_{2n}$-codes) when ${\rm…
The closed one-sided ideals of a C*-algebra are exactly the closed subspaces supported by the orthogonal complement of a closed projection. Let A be a (not necessarily selfadjoint) subalgebra of a unital C*-algebra B which contains the unit…
All subalgebras, idempotents, left(right) ideals and left quasi-units of two-dimensional algebras are described. Classification of algebras with given number of subalgebras, left(right) ideals are provided. In particular, a list of…
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in that class, taken as…
Minimizing the size of finite automata is a fundamental problem in theoretical computer science. Beyond standard minimization, further reductions can be achieved by decomposing an automaton into smaller components whose languages combine…
Most slowly synchronizing automata over binary alphabets are circular, i.e., containing a letter permuting the states in a single cycle, and their set of synchronizing words has maximal state complexity, which also implies complete…
For a word $S$, let $f(S)$ be the largest integer $m$ such that there are two disjoints identical (scattered) subwords of length $m$. Let $f(n, \Sigma) = \min \{f(S): S \text{is of length} n, \text{over alphabet} \Sigma \}$. Here, it is…
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of regular languages is the maximal syntactic complexity of languages in that subclass, taken as a function…
In the nonlinear field of multilinear operators and homogeneous polynomials between Banach spaces, we develop a technique, based on the transformation of vector-valued sequences, to create new examples of hyper-ideals of multilinear…
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in that class, taken as…
An ideal I of a commutative ring R is said to be irreducible if it cannot be written as the intersection of two larger ideals. A proper ideal I of a ring R is said to be strongly irreducible if for each ideals J, K of R, J\cap K\subseteq I…
There has arisen in recent years a substantial theory of "multiplier ideals'' in commutative rings. These are integrally closed ideals with properties that lend themselves to highly interesting applications. But how special are they among…
In this note, we define and investigate ideal covering numbers of associative rings (not assumed to be commutative or unital): three invariants defined as the minimal number of proper left, right, or two-sided ideals whose union equals the…
We show that if M is a DFA with n states over an arbitrary alphabet and L = L(M), then the worst-case state complexity of L^2 is n*2^n - 2^{n-1}. If, however, M is a DFA over a unary alphabet, then the worst-case state complexity of L^k is…
We identify largest ideals in Leavitt path algebras: the largest locally left/right artinian (which is the largest semisimple one), the largest locally left/right noetherian without minimal idempotents, the largest exchange, and the largest…
In this paper we investigate left ideals as codes in twisted skew group rings. The considered rings, which are often algebras over a finite field, allows us to detect many of the well-known codes. The presentation, given here, unifies the…