Enumeration of minimal acyclic automata via generalized parking functions

Autor:	Priez, Jean-Baptiste
Rok vydání:	2014
Předmět:	Mathematics - Combinatorics
Druh dokumentu:	Working Paper
Popis:	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.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1411.4757 Zobrazit plný text záznamu View this record from Arxiv