Pages that link to "Item:Q641179"
From MaRDI portal
The following pages link to Piecewise testable languages via combinatorics on words (Q641179):
Displaying 13 items.
- Normal forms under Simon's congruence (Q667852) (← links)
- Testing avoidability on sets of partial words is hard (Q1006080) (← links)
- A proof of Simon's theorem on piecewise testable languages (Q1391537) (← links)
- Separability by piecewise testable languages is \textsc{PTime}-complete (Q1698734) (← links)
- On shuffle products, acyclic automata and piecewise-testable languages (Q1730033) (← links)
- Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups (Q1731800) (← links)
- On Boolean combinations forming piecewise testable languages (Q2358689) (← links)
- A Note on Decidable Separability by Piecewise Testable Languages (Q2947878) (← links)
- Linear size test sets for certain commutative languages (Q3149085) (← links)
- Polynomial size test sets for commutative languages (Q4361579) (← links)
- AROUND DOT-DEPTH ONE (Q4923283) (← links)
- Separability by piecewise testable languages and downward closures beyond subwords (Q5145372) (← links)
- (Q5376657) (← links)