Pages that link to "Item:Q2849957"
From MaRDI portal
The following pages link to Separating Regular Languages by Piecewise Testable and Unambiguous Languages (Q2849957):
Displayed 20 items.
- The word problem for omega-terms over the Trotter-Weil hierarchy (Q1635816) (← links)
- Separability by piecewise testable languages is \textsc{PTime}-complete (Q1698734) (← links)
- Learning algorithms (Q2074213) (← links)
- Measuring power of locally testable languages (Q2164008) (← links)
- On the height of towers of subsequences and prefixes (Q2272979) (← links)
- Reducibility of pointlike problems (Q2362748) (← links)
- On the index of Simon's congruence for piecewise testability (Q2512830) (← links)
- Quantifier Alternation for Infinite Words (Q2811342) (← links)
- On Upper and Lower Bounds on the Length of Alternating Towers (Q2922026) (← links)
- A Note on Decidable Separability by Piecewise Testable Languages (Q2947878) (← links)
- Separating regular languages with two quantifier alternations (Q4558789) (← links)
- (Q4580330) (← links)
- (Q4968382) (← links)
- (Q5009453) (← links)
- (Q5089281) (← links)
- The Complexity of Separation for Levels in Concatenation Hierarchies (Q5090988) (← links)
- (Q5155687) (← links)
- (Q5376662) (← links)
- The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy (Q5740189) (← links)
- Weak Separation Problem for Tree Languages (Q5859635) (← links)