Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Enumeration of minim ...
Conference paper

Enumeration of minimal acyclic automata via generalized parking functions

Jean-Baptiste Priez (1)
(1) Laboratoire de Recherche en Informatique
Download article
Open on HAL
Imported on
November 21, 2016
Published on
December 31, 2014
Last modified on
March 31, 2025
Volume
DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015)
Proceedings
DOI
10.46298/dmtcs.2471
License
Attribution 4.0 International (CC BY 4.0)
Indicators
543
Views
700
Downloads

Enumeration of minimal acyclic automata via generalized parking functions

Jean-Baptiste Priez (1)
(1) Laboratoire de Recherche en Informatique
Abstract
English
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.
French
On donne une formule d’énumération exacte des automates finites déterministes acycliques minimaux. Cetteformule s’obtient à partir d’une bijection entre une famille fonctions de parking généralisées et les fonctions detransitions des automates acycliques.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • minimal acyclic deterministic finite automata
  • finite language
  • generalized parking function
  • species
Cited by

Source: OpenCitations

  • Hot Current Topics of Descriptional Complexity

    Authors : Martin Kutrib ORCID, Nelma Moreira ORCID, Giovanni Pighizzini ORCID, Rogério Reis ORCID

    Journal reference : Volume , 2021, pp. 3-28

    DOI : 10.1007/978-3-030-81701-5_1

  • Block Languages and Their Bitmap Representations

    Figshare

    Authors : Guilherme Duarte ORCID, Nelma Moreira ORCID, Luca Prigioniero ORCID, Rogério Reis ORCID

    Journal reference : Volume , 2024, pp. 124-137

    DOI : 10.1007/978-3-031-71112-1_9
Preview
Loading PDF preview...