Regular languages can be represented in many ways. Here we focus on the two major
description mechanisms, namely finite automata, to be more precise, deterministic and …

We search for the largest syntactic semigroups of star-free languages having n left quotients;
equivalently, we look for the largest transition semigroups of aperiodic finite automata with n …

The syntactic complexity of a subclass of the class of regular languages is the maximal
cardinality of syntactic semigroups of languages in that class, taken as a function of the state …

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

This paper investigates the state complexities of subword-closed and superword-closed
languages, comparing them to regular languages. We focus on the square root operator and …

We investigate the syntactic complexity of a class of circular semi-flower automata (CSFA)
classified by their bpi (s)–branch point (s) going in. In this work we obtain the syntactic …

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 …

We consider the problem of embedding a Wheeler Deterministic Finite Automaton (WDFA, in
short) into an equivalent complete WDFA, preserving the order of states and the accepted …

We study the properties of syntactic monoids of bifix-free regular languages. In particular, we
solve an open problem concerning syntactic complexity: We prove that the cardinality of the …

An automaton is monotonic if its states can be arranged in a linear order that is preserved by
the action of every letter. We prove that the problem of deciding whether a given automaton …