Pages that link to "Item:Q2921121"
From MaRDI portal
The following pages link to On separation by locally testable and locally threshold testable languages (Q2921121):
Displaying 18 items.
- A complete refinement procedure for regular separability of context-free languages (Q264992) (← links)
- Minimal consistent DFA revisited (Q306711) (← links)
- On generalized locally testable languages (Q760215) (← links)
- Pointlike sets and separation: a personal perspective (Q832918) (← links)
- Separability by piecewise testable languages is \textsc{PTime}-complete (Q1698734) (← links)
- Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT (Q2003999) (← links)
- Subsequence versus substring constraints in sequence pattern languages (Q2022305) (← links)
- Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games (Q2285664) (← links)
- Right and left strongly locally testable semigroups and languages (Q2708968) (← links)
- Separating regular languages with first-order logic (Q2794672) (← links)
- A Note on Decidable Separability by Piecewise Testable Languages (Q2947878) (← links)
- Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages (Q2963927) (← links)
- (Q3384892) (← links)
- (Q4580330) (← links)
- Separating regular languages with first-order logic (Q4635660) (← links)
- (Q4782722) (← links)
- (Q4989409) (← links)
- Separability by piecewise testable languages and downward closures beyond subwords (Q5145372) (← links)
