Applications of the finite state automata for counting restricted permutations and variations (Q5259332)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Applications of the finite state automata for counting restricted permutations and variations |
scientific article; zbMATH DE number 6451311
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Applications of the finite state automata for counting restricted permutations and variations |
scientific article; zbMATH DE number 6451311 |
Statements
Applications of the finite state automata for counting restricted permutations and variations (English)
0 references
26 June 2015
0 references
restricted variations
0 references
exact enumeration
0 references
0.92737967
0 references
0.8665508
0 references
0.8590558
0 references
0.85459447
0 references
0 references
0.8404516
0 references
