Automata and expressions - Archive ouverte HAL Access content directly
Book Sections Year : 2015

Automata and expressions

(1, 2)


Not very many results in computer science are recognised as being as basic and fundamental as Kleene theorem. It was originally stated as the equality of two sets of objects, and is still so, even if the names of the objects have changed.

This chapter proposes a new look at this statement, in two ways. First, we explain how Kleene theorem can be seen as the conjunction of two results with distinct hypotheses and scopes. Second, we express the first of these two results as the description of algorithms that relate the symbolic descriptions of the objects rather than as the equality of two sets.

The main benefit of splitting Kleene theorem into two steps is to bring to light that the first one is a statement whose scope extends much beyond languages. It is first generalised to subsets of arbitrary monoids and then, with some precaution, to subsets with multiplicity, that is, to (formal power) series. This latter extension of the realm of Kleene's theorem is a matter for the same `splitting' and distinction between series on arbitrary monoids and series on f.g. free monoids.

Not file

Dates and versions

hal-02286710 , version 1 (13-09-2019)


  • HAL Id : hal-02286710 , version 1


J. Sakarovitch. Automata and expressions. AutoMathA Handbook, European Mathematical Society, 2015. ⟨hal-02286710⟩
23 View
0 Download


Gmail Facebook Twitter LinkedIn More