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 functions

Authors: Jean-Baptiste Priez 1

  • 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.

https://doi.org/10.46298/dmtcs.2471
Source: 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
Imported 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]
Licence: Attribution 4.0 International (CC BY 4.0)

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo DOI 10.1016/s0097-3165(03)00009-8
  • 10.1016/s0097-3165(03)00009-8
Gončarov polynomials and parking functions

Share and export

Consultation statistics

This page has been seen 181 times.
This article's PDF has been downloaded 281 times.