The following pages link to (Q4542541):
Displayed 28 items.
- Regular languages of thin trees (Q290908) (← links)
- The complexity of intersecting finite automata having few final states (Q347114) (← links)
- Linear circuits, two-variable logic and weakly blocked monoids (Q391307) (← links)
- Fragments of first-order logic over infinite words (Q537914) (← links)
- On the lattice of sub-pseudovarieties of DA. (Q711615) (← links)
- Deciding \(\mathrm{FO}^2\) alternation for automata over finite and infinite words (Q832937) (← links)
- The word problem for omega-terms over the Trotter-Weil hierarchy (Q1635816) (← links)
- Varieties (Q2074217) (← links)
- The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy (Q2411037) (← links)
- Alternation Hierarchies of First Order Logic with Regular Predicates (Q2947877) (← links)
- Partially Ordered Two-Way Büchi Automata (Q3073637) (← links)
- Linear Completeness Thresholds for Bounded Model Checking (Q3088266) (← links)
- Characterization of Logics over Ranked Tree Languages (Q3540193) (← links)
- Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG] (Q3618574) (← links)
- Separating regular languages with two quantifier alternations (Q4558789) (← links)
- (Q4580330) (← links)
- (Q4989409) (← links)
- Separating Without Any Ambiguity. (Q5002824) (← links)
- (Q5092424) (← links)
- (Q5129940) (← links)
- One quantifier alternation in first-order logic with modular predicates (Q5245724) (← links)
- (Q5376662) (← links)
- The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy (Q5740189) (← links)
- Locality and Centrality: The Variety ZG (Q6076180) (← links)
- Conelikes and ranker comparisons (Q6109018) (← links)
- How many times do you need to go back to the future in unary temporal logic? (Q6109021) (← links)
- Forbidden Patterns for FO<sup>2</sup> Alternation Over Finite and Infinite Words (Q6169964) (← links)
- A Trichotomy for Regular Trail Queries (Q6178699) (← links)