The genus of regular languages

Guillaume Bonfante (1) , Florian Deloup (2)

1 CARBONE - Carbone
2 IMT - Institut de Mathématiques de Toulouse UMR5219

The article defines and studies the genus of finite state deterministic automata (FSA) and regular languages. Indeed, a FSA can be seen as a graph for which the notion of genus arises. At the same time, a FSA has a semantics via its underlying language. It is then natural to make a connection between the languages and the notion of genus. After we introduce and justify the the notion of the genus for regular languages, the following questions are addressed. First, depending on the size of the alphabet, we provide upper and lower bounds on the genus of regular languages : we show that under a relatively generic condition on the alphabet and the geometry of the automata, the genus grows at least linearly in terms of the size of the automata. Second, we show that the topological cost of the powerset determinization procedure is exponential. Third, we prove that the notion of minimization is orthogonal to the notion of genus. Fourth, we build regular languages of arbitrary large genus: the notion of genus defines a proper hierarchy of regular languages.

Domaines: Complexité [cs.CC]; Informatique [cs]

Guillaume Bonfante, Florian Deloup. The genus of regular languages. Mathematical Structures in Computer Science, 2018, 28 (1), pp.14-44. ⟨10.1017/S0960129516000037⟩. ⟨hal-03178814⟩