Pages that link to "Item:Q3188268"
From MaRDI portal
The following pages link to The Boolean Algebra of Piecewise Testable Languages (Q3188268):
Displaying 8 items.
- On Boolean combinations forming piecewise testable languages (Q2358689) (← links)
- Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages (Q2697538) (← links)
- Symbolic algorithms for language equivalence and Kleene algebra with tests (Q2819822) (← links)
- An Algebraic Characterization of Strictly Piecewise Languages (Q3010406) (← links)
- Polynomial size test sets for commutative languages (Q4361579) (← links)
- Definable Subsets of Polynomial-Time Algebraic Structures (Q5042236) (← links)
- (Q5376657) (← links)
- On the main scientific achievements of Victor Selivanov (Q6146819) (← links)