Pages that link to "Item:Q5300848"
From MaRDI portal
The following pages link to Alternative Automata Characterization of Piecewise Testable Languages (Q5300848):
Displayed 13 items.
- 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)
- Complexity of universality and related problems for partially ordered NFAs (Q2013561) (← links)
- Learning from positive and negative examples: dichotomies and parameterized algorithms (Q2169975) (← links)
- On Boolean combinations forming piecewise testable languages (Q2358689) (← links)
- On the index of Simon's congruence for piecewise testability (Q2512830) (← links)
- Obituary: Libor Polák (1950--2020) (Q2663112) (← links)
- On the Complexity of k-Piecewise Testability and the Depth of Automata (Q3451116) (← links)
- (Q4989409) (← links)
- (Q5005165) (← links)
- (Q5376657) (← links)
- On the Simon's congruence neighborhood of languages (Q6067338) (← links)