Pages that link to "Item:Q2266068"
From MaRDI portal
The following pages link to Finite semigroup varieties of the form V*D (Q2266068):
Displaying 50 items.
- Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← links)
- Categories as algebra: An essential ingredient in the theory of monoids (Q581545) (← links)
- Standard automata and semidirect products of transformation semigroups (Q685446) (← links)
- Equations and dot-depth one (Q688972) (← links)
- Semigroup presentations for test local groups. (Q744856) (← links)
- Pointlike sets and separation: a personal perspective (Q832918) (← links)
- Languages polylog-time reducible to dot-depth 1/2 (Q859980) (← links)
- The Schützenberger category of a semigroup. (Q906965) (← links)
- On the varieties of languages associated with some varieties of finite monoids with commuting idempotents (Q913522) (← links)
- Infinite-vertex free profinite semigroupoids and symbolic dynamics. (Q1004467) (← links)
- On varieties of rational languages and variable length codes. II (Q1079669) (← links)
- First-order logic and star-free sets (Q1088982) (← links)
- Locally trivial categories and unambiguous concatenation (Q1103056) (← links)
- Semigroups and languages of dot-depth two (Q1109125) (← links)
- Inverse monoids of dot-depth two (Q1124363) (← links)
- Results on homomorphic realization of automata by \(\alpha_ 0\)-products (Q1177141) (← links)
- Languages and scanners (Q1177931) (← links)
- On iterated semidirect products of finite semilattices (Q1178869) (← links)
- Two-sided wreath product of categories (Q1181464) (← links)
- Polynomial operations and hierarchies of concatenation (Q1183588) (← links)
- Local varieties of completely regular monoids (Q1194189) (← links)
- On a conjecture concerning dot-depth two languages (Q1200802) (← links)
- Games, equations and dot-depth two monoids (Q1201097) (← links)
- Varieties of automata and transformation semigroups (Q1207386) (← links)
- Some results on the dot-depth hierarchy (Q1207707) (← links)
- Semidirect products of pseudovarieties from the universal algebraist's point of view (Q1262958) (← links)
- Trees, congruences and varieties of finite semigroups (Q1270818) (← links)
- Equations and monoid varieties of dot-depth one and two (Q1314381) (← links)
- On a complete set of generators for dot-depth two (Q1324687) (← links)
- Polynomial closure and unambiguous product (Q1361889) (← links)
- Profinite categories and semidirect products (Q1380025) (← links)
- Finite semigroup varieties defined by programs (Q1390876) (← links)
- Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata. (Q1401334) (← links)
- Level two of the quantifier alternation hierarchy over infinite words (Q1635804) (← links)
- Separability by piecewise testable languages is \textsc{PTime}-complete (Q1698734) (← links)
- Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups (Q1731800) (← links)
- The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages (Q1748357) (← links)
- Games, equations and the dot-depth hierarchy (Q1823928) (← links)
- Algebraic tools for the concatenation product. (Q1853747) (← links)
- Some complexity results for polynomial rational expressions. (Q1874419) (← links)
- Inclusion relations between some congruences related to the dot-depth hierarchy (Q1917345) (← links)
- The word problem for \(\kappa \)-terms over the pseudovariety of local groups (Q1982578) (← links)
- Complexity of universality and related problems for partially ordered NFAs (Q2013561) (← links)
- Varieties (Q2074217) (← links)
- Characterizing level one in group-based concatenation hierarchies (Q2097235) (← links)
- Graph congruences and wreath products (Q2266130) (← links)
- Machines that can output empty words (Q2272215) (← links)
- Generic results for concatenation hierarchies (Q2311891) (← links)
- On the expressive power of temporal logic (Q2366686) (← links)
- A new algorithm for testing if a regular language is locally threshold testable (Q2380003) (← links)
