The following pages link to (Q4407441):
Displayed 27 items.
- Language theoretical properties of hairpin formations (Q418760) (← links)
- Conservative groupoids recognize only regular languages (Q476161) (← links)
- Fragments of first-order logic over infinite words (Q537914) (← links)
- The word problem for \(\omega \)-terms over DA (Q650888) (← links)
- On the lattice of sub-pseudovarieties of DA. (Q711615) (← links)
- Pure future local temporal logics are expressively complete for Mazurkiewicz traces (Q859824) (← links)
- Two algebraic approaches to variants of the concatenation product (Q861283) (← links)
- Polynomials, fragments of temporal logic and the variety DA over traces (Q880176) (← links)
- The word problem for omega-terms over the Trotter-Weil hierarchy (Q1635816) (← links)
- Geometrically closed positive varieties of languages (Q2084767) (← links)
- Omega-rational expressions with bounded synchronization delay (Q2354594) (← links)
- The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy (Q2411037) (← links)
- Pseudovarieties of ordered completely regular semigroups (Q2422183) (← links)
- Learning expressions and programs over monoids (Q2490112) (← links)
- The Shuffle Product: New Research Directions (Q2799163) (← links)
- On FO 2 Quantifier Alternation over Words (Q3182951) (← links)
- The intersection problem for finite monoids (Q3304129) (← links)
- Efficiency of automata in semi-commutation verification techniques (Q3515458) (← links)
- Representation theory of finite semigroups, semigroup radicals and formal language theory (Q3617621) (← links)
- Separating Without Any Ambiguity. (Q5002824) (← links)
- The Power of Programs over Monoids in DA (Q5111216) (← links)
- Reversible Regular Languages: Logical and Algebraic Characterisations (Q5158652) (← links)
- One quantifier alternation in first-order logic with modular predicates (Q5245724) (← links)
- The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy (Q5740189) (← links)
- The Intersection Problem for Finite Semigroups (Q5859649) (← links)
- Circuit complexity of regular languages (Q5895106) (← links)
- How many times do you need to go back to the future in unary temporal logic? (Q6109021) (← links)