 |
Discrete Mathematics & Theoretical Computer Science |  |
Priez, Jean-Baptiste - 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)Enumeration of minimal acyclic automata via generalized parking functions
Authors: Priez, Jean-Baptiste
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.
Source : oai:HAL:hal-01337781v1
Volume: DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015)
Section: Proceedings
Published on: January 1, 2015
Submitted on: November 21, 2016
Keywords: generalized parking function,species,finite language,minimal acyclic deterministic finite automata,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
Consultation statistics
This page has been seen 74 times.
This article's PDF has been downloaded 201 times.