The following pages link to (Q4465333):
Displaying 20 items.
- The state complexity of random DFAs (Q338393) (← links)
- A large deviations principle for the Maki-Thompson rumour model (Q495179) (← links)
- On binary circle plus operator \(\oplus\)-NFAs and succinct descriptions of regular languages (Q703507) (← links)
- Enumeration and random generation of accessible automata (Q995562) (← links)
- State complexity of power (Q1019718) (← links)
- Compacted binary trees admit a stretched exponential (Q2005184) (← links)
- Enumerating regular expressions and their languages (Q2074215) (← links)
- Succinct representation for (non)deterministic finite automata (Q2084735) (← links)
- Succinct representations for (non)deterministic finite automata (Q2232264) (← links)
- More on deterministic and nondeterministic finite cover automata (Q2357103) (← links)
- A hitchhiker's guide to descriptional complexity through analytic combinatorics (Q2437857) (← links)
- Enumeration and generation with a string automata representation (Q2465040) (← links)
- On the average state and transition complexity of finite languages (Q2465048) (← links)
- Exact enumeration of acyclic deterministic automata (Q2489949) (← links)
- Minimizing nfa's and regular expressions (Q2641868) (← links)
- More on Deterministic and Nondeterministic Finite Cover Automata (Q2947414) (← links)
- State complexity of cyclic shift (Q3515466) (← links)
- Compact Normal Form for Regular Languages as Xor Automata (Q3637338) (← links)
- Learning Finite Automata Using Label Queries (Q3648751) (← links)
- Semicomputable points in Euclidean spaces (Q5092426) (← links)
