Jean-Baptiste Priez
-
Enumeration of minimal acyclic automata via generalized parking functions
dmtcs:2471 -
Discrete Mathematics & Theoretical Computer Science,
January 1, 2015,
DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015)
-
https://doi.org/10.46298/dmtcs.2471
Enumeration of minimal acyclic automata via generalized parking functionsConference paper
Authors: Jean-Baptiste Priez 1
NULL
Jean-Baptiste Priez
1 Laboratoire de Recherche en Informatique
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.
Guilherme Duarte;Nelma Moreira;Luca Prigioniero;Rogério Reis, Lecture notes in computer science, Block Languages and Their Bitmap Representations, pp. 124-137, 2024, 10.1007/978-3-031-71112-1_9.