Pages that link to "Item:Q1103056"
From MaRDI portal
The following pages link to Locally trivial categories and unambiguous concatenation (Q1103056):
Displayed 30 items.
- Fragments of first-order logic over infinite words (Q537914) (← links)
- Categories as algebra: An essential ingredient in the theory of monoids (Q581545) (← links)
- \(NC^ 1\): The automata-theoretic viewpoint (Q685708) (← 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)
- Products of languages with counter (Q917324) (← links)
- Semigroups and languages of dot-depth two (Q1109125) (← links)
- Two-sided wreath product of categories (Q1181464) (← links)
- Some results on the dot-depth hierarchy (Q1207707) (← links)
- On the Pin-Thérien expansion of idempotent monoids (Q1337479) (← links)
- Polynomial closure and unambiguous product (Q1361889) (← links)
- Varieties (Q2074217) (← links)
- Space complexity of reachability testing in labelled graphs (Q2316928) (← links)
- Bases for pseudovarieties closed under bideterministic product (Q2330863) (← links)
- Omega-rational expressions with bounded synchronization delay (Q2354594) (← links)
- Theme and Variations on the Concatenation Product (Q3014930) (← links)
- On Decidability of Intermediate Levels of Concatenation Hierarchies (Q3451089) (← links)
- A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS (Q3538848) (← links)
- A STRUCTURAL APPROACH TO THE LOCALITY OF PSEUDOVARIETIES OF THE FORM LH ⓜ V (Q3561124) (← links)
- Representation theory of finite semigroups, semigroup radicals and formal language theory (Q3617621) (← links)
- Varieties of finite categories (Q3748457) (← links)
- Catégories et langages de dot-depth un (Q3809287) (← links)
- Polynomial closure and unambiguous product (Q4645191) (← links)
- MONOIDS AND COMPUTATIONS (Q4658713) (← links)
- SOME OPERATORS THAT PRESERVE THE LOCALITY OF A PSEUDOVARIETY OF SEMIGROUPS (Q4923203) (← links)
- Separating Without Any Ambiguity. (Q5002824) (← links)
- On All Things Star-Free (Q5092328) (← links)
- THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS (Q5462667) (← links)
- Space Complexity of Reachability Testing in Labelled Graphs (Q5739010) (← links)
- How many times do you need to go back to the future in unary temporal logic? (Q6109021) (← links)