טוען...
Finite automata, probabilistic method, and occurrence enumeration of a pattern in words and permutations
The main theme of this paper is the enumeration of the order-isomorphic occurrence of a pattern in words and permutations. We mainly focus on asymptotic properties of the sequence [Formula: see text] , the number of n-array k-ary words that contain a given pattern v exactly r times. In addition, we...
שמור ב:
| הוצא לאור ב: | SIAM J Discret Math |
|---|---|
| Main Authors: | , , |
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
2020
|
| נושאים: | |
| גישה מקוונת: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7144682/ https://ncbi.nlm.nih.gov/pubmed/32273646 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1137/19m1262206 |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|