We give an exact enumerative formula for the minimal acyclic deterministic
finite automata. This formula is obtained from a bijection between a family of
generalized parking functions and the transitions functions of acyclic
automata

Priez, Jean-Baptiste

English

arXiv

International audienceWe give an exact enumerative formula for the minimal acyclic deterministic finite automata. This formula is obtained from a bijection between a family of generalized parking functions and the transitions functions of acyclic automata.On donne une formule d’énumération exacte des automates finites déterministes acycliques minimaux. Cetteformule s’obtient à partir d’une bijection entre une famille fonctions de parking généralisées et les fonctions detransitions des automates acycliques

Enumeration of minimal acyclic automata via generalized parking functions

Abstract

Similar works

Full text

Available Versions

HAL-CentraleSupelec

Archive Ouverte en Sciences de l'Information et de la Communication