The following pages link to (Q4782722):
Displaying 12 items.
- Reducing the time complexity of testing for local threshold testability (Q703505) (← links)
- Separability by piecewise testable languages is \textsc{PTime}-complete (Q1698734) (← links)
- On Boolean combinations forming piecewise testable languages (Q2358689) (← links)
- A new algorithm for testing if a regular language is locally threshold testable (Q2380003) (← links)
- On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs (Q2914712) (← links)
- On the Complexity of k-Piecewise Testability and the Depth of Automata (Q3451116) (← links)
- (Q3484371) (← links)
- (Q4474160) (← links)
- Piecewise testable languages and nondeterministic automata (Q4608630) (← links)
- (Q4989409) (← links)
- (Q5005165) (← links)
- (Q5376657) (← links)