Pages that link to "Item:Q1698734"
From MaRDI portal
The following pages link to Separability by piecewise testable languages is \textsc{PTime}-complete (Q1698734):
Displaying 6 items.
- On the height of towers of subsequences and prefixes (Q2272979) (← links)
- A Note on Decidable Separability by Piecewise Testable Languages (Q2947878) (← links)
- Piecewise testable languages and nondeterministic automata (Q4608630) (← links)
- (Q4989409) (← links)
- The Complexity of Separation for Levels in Concatenation Hierarchies (Q5090988) (← links)
- Separability by piecewise testable languages and downward closures beyond subwords (Q5145372) (← links)