Pages that link to "Item:Q2904752"
From MaRDI portal
The following pages link to Asymptotic enumeration of minimal automata (Q2904752):
Displaying 8 items.
- The state complexity of random DFAs (Q338393) (← links)
- Compacted binary trees admit a stretched exponential (Q2005184) (← links)
- Enumerating regular expressions and their languages (Q2074215) (← links)
- Enumeration of minimal acyclic automata via generalized parking functions (Q2803338) (← links)
- The minimal automaton recognizing \(m\mathbb N\) in a linear numeration system (Q2855521) (← links)
- Random Deterministic Automata (Q2921998) (← links)
- Counting Minimal Symmetric Difference NFAs (Q4910480) (← links)
- Asymptotics of Minimal Deterministic Finite Automata Recognizing a Finite Binary Language (Q5874410) (← links)