Pages that link to "Item:Q764348"
From MaRDI portal
The following pages link to Absoluteness of subword inequality is undecidable (Q764348):
Displayed 9 items.
- On computational complexity of graph inference from counting (Q269786) (← links)
- Absent subsequences in words (Q2695493) (← links)
- A NOTE ON THE DECIDABILITY OF SUBWORD INEQUALITIES (Q2856016) (← links)
- Scattered Factor-Universality of Words (Q5041246) (← links)
- Context-Freeness of Word-MIX Languages (Q5041269) (← links)
- Absent Subsequences in Words (Q6070611) (← links)
- Longest Common Subsequence with Gap Constraints (Q6134862) (← links)
- Subsequences in bounded ranges: matching and analysis problems (Q6173109) (← links)
- (Q6190431) (← links)