Pages that link to "Item:Q758204"
From MaRDI portal
The following pages link to An algorithm for distinguishing efficiently bit-strings by their subsequences (Q758204):
Displaying 10 items.
- The shortest common nonsubsequence problem is NP-complete (Q1208726) (← links)
- Nearly \(k\)-universal words -- investigating a part of Simon's congruence (Q2112180) (← links)
- On Simon's congruence closure of a string (Q2112187) (← links)
- Absent subsequences in words (Q2695493) (← links)
- Scattered Factor-Universality of Words (Q5041246) (← links)
- Absent Subsequences in Words (Q6070611) (← links)
- Nearly \(k\)-universal words -- investigating a part of Simon's congruence (Q6073651) (← links)
- On Simon's congruence closure of a string (Q6093575) (← links)
- Simon's congruence pattern matching (Q6204538) (← links)
- Matching patterns with variables under Simon's congruence (Q6623024) (← links)
