Pages that link to "Item:Q5167850"
From MaRDI portal
The following pages link to Going Higher in the First-Order Quantifier Alternation Hierarchy on Words (Q5167850):
Displaying 32 items.
- Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← links)
- Local testability from words to traces, a suitable definition (Q728279) (← links)
- Level two of the quantifier alternation hierarchy over infinite words (Q1635804) (← links)
- Separability by piecewise testable languages is \textsc{PTime}-complete (Q1698734) (← links)
- The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages (Q1748357) (← links)
- Varieties (Q2074217) (← links)
- Profinite topologies (Q2074218) (← links)
- The factorisation forest theorem (Q2074219) (← links)
- Pro-aperiodic monoids via saturated models (Q2279939) (← links)
- Generic results for concatenation hierarchies (Q2311891) (← links)
- Concatenation hierarchies: new bottle, old wine (Q2399361) (← links)
- The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy (Q2411037) (← links)
- Quantifier Alternation for Infinite Words (Q2811342) (← links)
- Alternation Hierarchies of First Order Logic with Regular Predicates (Q2947877) (← links)
- A Note on Decidable Separability by Piecewise Testable Languages (Q2947878) (← links)
- Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable (Q2957893) (← links)
- On Decidability of Intermediate Levels of Concatenation Hierarchies (Q3451089) (← links)
- (Q4202955) (← links)
- Separating regular languages with two quantifier alternations (Q4558789) (← links)
- (Q4580330) (← links)
- (Q4968382) (← links)
- Separating Without Any Ambiguity. (Q5002824) (← links)
- (Q5009453) (← links)
- (Q5079753) (← links)
- The Complexity of Separation for Levels in Concatenation Hierarchies (Q5090988) (← links)
- On All Things Star-Free (Q5092328) (← links)
- The Quantifier Alternation Hierarchy of Synchronous Relations (Q5092389) (← links)
- (Q5129940) (← links)
- Going Higher in First-Order Quantifier Alternation Hierarchies on Words (Q5244385) (← links)
- (Q5376662) (← links)
- Level Two of the Quantifier Alternation Hierarchy over Infinite Words (Q5740188) (← links)
- The omega-reducibility of pseudovarieties of ordered monoids representing low levels of concatenation hierarchies (Q6195308) (← links)