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 …

In this work we construct an automaton for the commutative closure of a given regular group
language. The number of states of the resulting automaton is bounded by the number of …

The state complexity of the result of a regular operation is often positively correlated with the
number of distinct transformations induced by letters in the minimal deterministic finite …

A fooling set for a regular language is a special set of pairs of strings whose size provides a
lower bound on the number of states in any nondeterministic finite automaton accepting this …

Operations on regular languages that commute with any inverse alphabetic morphism are
called 1-uniform transformations. In a previous work we have shown that these operations …

We consider the state complexity of intersection, union and the shuffle operation on
commutative regular languages for arbitrary alphabets. Certain invariants will be introduced …

We consider the state complexity of projection, shuffle, up-and downward closure and
interior on commutative regular languages. We deduce the state complexity bound n| Σ| for …

We investigate the state complexity of the star of symmetrical differences using modifiers and
monsters. A monster is an automaton in which every function from states to states is …

We investigate the descriptional complexity of basic regular operations on languages
represented by Boolean and alternating finite automata. In particular, we consider the …

We introduce the class 𝒞𝒪𝓂 S+ of commutative regular languages that is a positive variety
closed under binary shuffle and iterated shuffle (also called shuffle closure). This class …