The following pages link to (Q4737911):
Displayed 18 items.
- The word problem for omega-terms over the Trotter-Weil hierarchy (Q1635816) (← links)
- On shuffle products, acyclic automata and piecewise-testable languages (Q1730033) (← links)
- Complexity of universality and related problems for partially ordered NFAs (Q2013561) (← links)
- On Simon's congruence closure of a string (Q2112187) (← links)
- State complexity of permutation and related decision problems on alphabetical pattern constraints (Q2117669) (← links)
- First-order rewritability of ontology-mediated queries in linear temporal logic (Q2238711) (← links)
- The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy (Q2411037) (← links)
- Partially Ordered Two-Way Büchi Automata (Q3073637) (← links)
- On FO 2 Quantifier Alternation over Words (Q3182951) (← links)
- (Q4989409) (← links)
- (Q5005165) (← links)
- The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy (Q5740189) (← links)
- Circuit complexity of regular languages (Q5895106) (← links)
- Circuit complexity of regular languages (Q5918477) (← links)
- State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs (Q6070752) (← links)
- On Simon's congruence closure of a string (Q6093575) (← links)
- Conelikes and ranker comparisons (Q6109018) (← links)
- Simon's congruence pattern matching (Q6204538) (← links)