Pages that link to "Item:Q5278426"
From MaRDI portal
The following pages link to The Height of Piecewise-Testable Languages with Applications in Logical Complexity (Q5278426):
Displayed 13 items.
- On shuffle products, acyclic automata and piecewise-testable languages (Q1730033) (← links)
- Nearly \(k\)-universal words -- investigating a part of Simon's congruence (Q2112180) (← links)
- On Boolean combinations forming piecewise testable languages (Q2358689) (← links)
- Absent subsequences in words (Q2695493) (← links)
- Well-Quasi Orders and Hierarchy Theory (Q3295154) (← links)
- Scattered Factor-Universality of Words (Q5041246) (← links)
- (Q5376657) (← links)
- Absent Subsequences in Words (Q6070611) (← links)
- Nearly \(k\)-universal words -- investigating a part of Simon's congruence (Q6073651) (← links)
- Ranking and Unranking k-Subsequence Universal Words (Q6134861) (← links)
- Longest Common Subsequence with Gap Constraints (Q6134862) (← links)
- Subsequences in bounded ranges: matching and analysis problems (Q6173109) (← links)
- (Q6190431) (← links)