We analyze the average complexity of Brzozowskiâ€™s minimization algorithm for distributions of deterministic automata with a small number of final states. We show that, as in the case of the uniformâ€¦ (More)

We study the number of states of the minimal automaton of the mirror of a rational language recognized by a random deterministic automaton with n states. We prove that, for any d > 0, the probabilityâ€¦ (More)

We propose algorithms that use Markov chain techniques to generate acyclic automata uniformly at random. We first consider deterministic, accessible and acyclic automata, then focus on the class ofâ€¦ (More)

The economic literature has suggested that the competition among teams in a football league can be modeled through the window of the contests theory. This paper proposes to evaluate empirically theâ€¦ (More)

In this article we propose an algorithm, based on Markov chain techniques, to generate random automata that are deterministic, accessible and acyclic. The distribution of the output approaches theâ€¦ (More)

We analyze the average complexity of Brzozowskiâ€™s minimization algorithm for distributions of deterministic automata with a small number of final states. We show that, as in the case of the uniformâ€¦ (More)

In this article, we propose a uniform random generator for accessible deterministic acyclic automata with n states, which is based on the recursive method. The generator has a preprocessing thatâ€¦ (More)