Enumeration and random generation of accessible automata (Q995562)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5186607
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumeration and random generation of accessible automata |
scientific article; zbMATH DE number 5186607 |
Statements
Enumeration and random generation of accessible automata (English)
0 references
3 September 2007
0 references
finite automata
0 references
bijections
0 references
asymptotic enumeration
0 references
random generation
0 references
Boltzmann samplers
0 references
0.9477236
0 references
0.92689425
0 references
0.9168853
0 references
0.9086518
0 references
0.90481114
0 references
0.8908089
0 references
0.8802387
0 references
0 references
