Descriptional complexity is the study of the conciseness of the various models representing
formal languages. The state complexity of a regular language is the size, measured by the …

Atoms of a (regular) language L were introduced by Brzozowski and Tamm in 2011 as
intersections of complemented and uncomplemented quotients of L. They derived tight …

A right ideal (left ideal, two-sided ideal) is a non-empty language L over an alphabet Σ such
that L=LΣ^* (L=Σ^*L, L=Σ^*LΣ^*). Let k=3 for right ideals, 4 for left ideals and 5 for two-sided …

A language L over an alphabet\varSigma is suffix-convex if, for any words x, y, z
∈\varSigma^*, whenever z and xyz are in L, then so is yz. Suffix-convex languages include …

We survey recent results concerning the complexity of regular languages represented by
their minimal deterministic finite automata. In addition to the quotient complexity of the …

The state complexity of operations on regular languages is an active area of research in
theoretical computer science. Through connections with algebra, particularly the theory of …

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 …

The paper determines the number of states in a deterministic finite automaton (DFA)
necessary to represent “unambiguous” variants of the union, concatenation, and Kleene star …

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 …

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 …