Pages that link to "Item:Q4608630"
From MaRDI portal
The following pages link to Piecewise testable languages and nondeterministic automata (Q4608630):
Displaying 12 items.
- Separability by piecewise testable languages is \textsc{PTime}-complete (Q1698734) (← links)
- On shuffle products, acyclic automata and piecewise-testable languages (Q1730033) (← links)
- Testing language containment for \(\omega\)-automata using BDDs (Q1891138) (← links)
- Complexity of universality and related problems for partially ordered NFAs (Q2013561) (← links)
- On Boolean combinations forming piecewise testable languages (Q2358689) (← links)
- Alternating complexity of counting first-order logic for the subword order (Q2687036) (← links)
- Piecewise directable automata (Q2731278) (← links)
- A Note on Decidable Separability by Piecewise Testable Languages (Q2947878) (← links)
- (Q4900328) (← links)
- (Q4989409) (← links)
- (Q5089232) (← links)
- (Q5376657) (← links)