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 …

The purpose of the paper is to give an introductory survey of the main aspects and results
regarding the relative succinctness of different representations of languages, such as finite …

The past research on the state complexity of operations on regular languages is examined,
and a new approach based on an old method (derivatives of regular expressions) is …

The states of a finite-state automaton 𝒩 can be identified with collections of words in the
prefix closure of the regular language accepted by 𝒩. But words can be ordered, and among …

A language L over an alphabet Σ is a right (left) ideal if it satisfies L= LΣ∗(L= Σ∗ L). It is a two-
sided ideal if L= Σ∗ LΣ∗, and an all-sided ideal if L= Σ∗ L, the shuffle of Σ∗ with L. Ideal …

In recent years, dynamic languages, such as JavaScript or Python, have been increasingly
used in a wide range of fields and applications. Their tricky and misunderstood behaviors …

Regular expressions (regexes) are a fundamental concept across the fields of computer
science. However, they can also induce the Regular expression Denial of Service (ReDoS) …

The state complexity of a regular language is the number of states in the minimal
deterministic automaton accepting the language. The syntactic complexity of a regular …

The state complexity of a regular language is the number of states of its minimal
determinitisc finite automaton. The complexity of a language operation is the complexity of …

A transition is unobservable if it is labeled by a symbol removed by a projection. The present
paper investigates a new structural property of incomplete deterministic finite automata–a …