Pages that link to "Item:Q5327430"
From MaRDI portal
The following pages link to Efficient Separability of Regular Languages by Subsequences and Suffixes (Q5327430):
Displaying 21 items.
- Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← links)
- Separability by piecewise testable languages is \textsc{PTime}-complete (Q1698734) (← links)
- Learning algorithms (Q2074213) (← links)
- Certifying DFA bounds for recognition and separation (Q2147179) (← links)
- Certifying inexpressibility (Q2233423) (← links)
- On the height of towers of subsequences and prefixes (Q2272979) (← 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)
- Efficient Enumeration of Regular Languages (Q3503909) (← links)
- Separating regular languages with two quantifier alternations (Q4558789) (← links)
- (Q4580330) (← links)
- (Q4968382) (← links)
- (Q4989409) (← links)
- (Q5009453) (← links)
- The Complexity of Separation for Levels in Concatenation Hierarchies (Q5090988) (← links)
- (Q5155687) (← links)
- (Q5376662) (← links)
- Weak Separation Problem for Tree Languages (Q5859635) (← links)
- The amazing mixed polynomial closure and its applications to two-variable first-order logic (Q6649443) (← links)