A new approach to regular \& indeterminate strings (Q2220865)
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: A new approach to regular \& indeterminate strings |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new approach to regular \& indeterminate strings |
scientific article |
Statements
A new approach to regular \& indeterminate strings (English)
0 references
25 January 2021
0 references
indeterminate string
0 references
degenerate string
0 references
generalized string
0 references
transitive closure
0 references
palindrome
0 references
maximal palindrome array
0 references
Manacher's condition
0 references
reverse engineering
0 references
algorithm
0 references
stringology
0 references
0 references
0 references
0.8299270868301392
0 references
0.7648191452026367
0 references
0.7578178644180298
0 references
0.7353949546813965
0 references
0.718561589717865
0 references
