Autor: |
Jean-Baptiste Priez |
Jazyk: |
angličtina |
Rok vydání: |
2015 |
Předmět: |
|
Zdroj: |
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings, 27th..., Iss Proceedings (2015) |
Druh dokumentu: |
article |
ISSN: |
1365-8050 |
DOI: |
10.46298/dmtcs.2471 |
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: |
Directory of Open Access Journals |
Externí odkaz: |
|