Pages that link to "Item:Q3585010"
From MaRDI portal
The following pages link to On Languages Piecewise Testable in the Strict Sense (Q3585010):
Displayed 10 items.
- The expressivity of autosegmental grammars (Q667923) (← links)
- Learning in the limit with lattice-structured hypothesis spaces (Q714848) (← links)
- On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684) (← links)
- Handling infinitely branching well-structured transition systems (Q1686118) (← links)
- Separability by piecewise testable languages is \textsc{PTime}-complete (Q1698734) (← links)
- Deterministic top-down tree automata with Boolean deterministic look-ahead (Q2163373) (← links)
- On the index of Simon's congruence for piecewise testability (Q2512830) (← links)
- An Algebraic Characterization of Strictly Piecewise Languages (Q3010406) (← links)
- (Q5005165) (← links)
- Relativized adjacency (Q6053841) (← links)