Enumeration of minimal acyclic automata via generalized parking functions
Combinatorics
2015-05-07 v2
Abstract
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.
Keywords
Cite
@article{arxiv.1411.4757,
title = {Enumeration of minimal acyclic automata via generalized parking functions},
author = {Jean-Baptiste Priez},
journal= {arXiv preprint arXiv:1411.4757},
year = {2015}
}