-
Asymptotic enumeration of Minimal Automata
International audience -
Schützenberger and Eilenberg theorems for words on linear orderings
International audience -
Bar Codes for Regular Languages
Regular expressions and finite automata represent regular languages. The link between these two mathematical structures is the subject of many research topics. Each... -
New decidable upper bound of the second level in the Straubing-Therien concat...
special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to Applications
