Related papers: Most Complex Regular Ideal Languages
A left ideal of any $C^*$-algebra is an example of an operator algebra with a right contractive approximate identity (r.c.a.i.). Indeed left ideals in $C^*$-algebras may be characterized as the class of such operator algebras, which happen…
We study descriptive complexity properties of the class of regular bifix-free languages, which is the intersection of prefix-free and suffix-free regular languages. We show that there exist a single ternary universal (stream of) bifix-free…
A language $L$ is the orthogonal catenation of languages $L_1$ and $L_2$ if every word of $L$ can be written in a unique way as a catenation of a word in $L_1$ and a word in $L_2$. We establish a tight bound for the state complexity of…
We consider ideals and Boolean combinations of ideals. For the regular languages within these classes we give expressively complete automaton models. In addition, we consider general properties of regular ideals and their Boolean…
A regular language $L$ is union-free if it can be represented by a regular expression without the union operation. A union-free language is deterministic if it can be accepted by a deterministic one-cycle-free-path finite automaton; this is…
Interpolation theory for complex polynomials is well understood. In the non-commutative quaternionic setting, the polynomials can be evaluated "on the left" and "on the right". If the interpolation problem involves interpolation conditions…
We associate lattices to the sets of unions and intersections of left and right quotients of a regular language. For both unions and intersections, we show that the lattices we produce using left and right quotients are dual to each other.…
We give a necessary and sufficient criterion for an operator in a nest algebra to belong to a proper two-sided ideal of that algebra. Using this result, we describe the strong radical of a nest algebra, and give a general description of the…
A cover by left ideals of an associative (not necessarily commutative or unital) ring $R$ is a collection of proper left ideals whose set-theoretic union equals $R$. If such a cover exists, then $\eta_\ell(R)$ is the cardinality of a…
A language L is prefix-free if, whenever words u and v are in L and u is a prefix of v, then u=v. Suffix-, factor-, and subword-free languages are defined similarly, where "subword" means "subsequence". A language is bifix-free if it is…
A language L is suffix-convex if for any words u, v,w, whenever w and uvw are in L, vw is in L as well. Suffix-convex languages include left ideals, suffix-closed languages, and suffix-free languages, which were studied previously. In this…
In this paper, we have introduced the notion of (1,2)-ideal in an LA-semigroup and shown that (1,2)-ideal and two-sided ideal coincide in an intra-regular LA-semigroup. We have characterized an intra-regular LA-semigroup by using the…
Ideal series of semigroups play an important role in the examination of semigroups which have proper two-sided ideals. But the corresponding theorems cannot be used when left simple (or right simple or simple) semigroups are considered. So…
We show that for every positive integer R there exist monomial ideals generated in degree two, with linear syzygies, and regularity of the quotient equal to R. Such examples can not be found among Gorenstein ideals since the regularity of…
We describe witness languages meeting the upper bound on the state complexity of the multiple concatenation of $k$ regular languages over an alphabet of size $k+1$ with a significantly simpler proof than that in the literature. We also…
If $I$ is a monomial ideal with linear quotients, then it has componentwise linear quotients. However, the converse of this statement is an open question. In this paper, we provide two classes of ideals for which the converse of this…
Let $R$ be a ring, $\CC_R$ and $\pCCR$ be the set of regular and left regular elements of $R$ ($\CC_R\subseteq \pCCR$). Goldie's Theorem is a semisimplicity criterion for the classical left quotient ring $Q_{l,cl}(R):=\CC_R^{-1}R$.…
The \emph{state complexity} of a regular language $L_m$ is the number $m$ of states in a minimal deterministic finite automaton (DFA) accepting $L_m$. The state complexity of a regularity-preserving binary operation on regular languages is…
We study the complexity of computation in finitely generated free left, right and two-sided adequate semigroups and monoids. We present polynomial time (quadratic in the RAM model of computation) algorithms to solve the word problem and…
Given a regular language $L$, we study the language of words $\mathsf{D}(L)$, that distinguish between pairs of different left-quotients of $L$. We characterize this distinguishability operation, show that its iteration has always a fixed…