Pages that link to "Item:Q706616"
From MaRDI portal
The following pages link to \(\omega\)-regular languages are testable with a constant number of queries (Q706616):
Displaying 6 items.
- Testable and untestable classes of first-order formulae (Q440006) (← links)
- Property testing of regular tree languages (Q2461542) (← links)
- Sublinear DTD Validity (Q2799222) (← links)
- Property Testing for Bounded Degree Databases (Q3304100) (← links)
- Indistinguishability and First-Order Logic (Q3502636) (← links)
- Relational Properties Expressible with One Universal Quantifier Are Testable (Q3646124) (← links)
