Pages that link to "Item:Q2358689"
From MaRDI portal
The following pages link to On Boolean combinations forming piecewise testable languages (Q2358689):
Displayed 6 items.
- On shuffle products, acyclic automata and piecewise-testable languages (Q1730033) (← links)
- Complexity of universality and related problems for partially ordered NFAs (Q2013561) (← links)
- Alternating complexity of counting first-order logic for the subword order (Q2687036) (← links)
- (Q4989409) (← links)
- (Q5089232) (← links)
- (Q5376657) (← links)