Asymptotic enumeration of Minimal Automata
From MaRDI portal
Publication:2904752
DOI10.4230/LIPIcs.STACS.2012.88zbMath1245.68118arXiv1109.5683MaRDI QIDQ2904752
Andrea Sportiello, Julien David, Frédérique Bassino
Publication date: 23 August 2012
Full work available at URL: https://arxiv.org/abs/1109.5683
Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (5)
The state complexity of random DFAs ⋮ Random Deterministic Automata ⋮ Sturmian and Infinitely Desubstitutable Words Accepted by an $$\omega $$-Automaton ⋮ Compacted binary trees admit a stretched exponential ⋮ Enumerating regular expressions and their languages
This page was built for publication: Asymptotic enumeration of Minimal Automata
