Pages that link to "Item:Q5339335"
From MaRDI portal
The following pages link to On finite monoids having only trivial subgroups (Q5339335):
Displayed 50 items.
- Families of recognizable sets corresponding to certain varieties of finite monoids (Q599182) (← links)
- A note on the commutative closure of star-free languages (Q672729) (← links)
- Logical definability on infinite traces (Q672860) (← links)
- Regular languages and Stone duality (Q675860) (← links)
- \(NC^ 1\): The automata-theoretic viewpoint (Q685708) (← links)
- Equations and dot-depth one (Q688972) (← links)
- Almost finite expansions of arbitrary semigroups (Q798447) (← links)
- Non-uniform automata over groups (Q804303) (← links)
- On the expressive power of temporal logic for infinite words (Q805240) (← links)
- Finite-automaton aperiodicity is PSPACE-complete (Q809608) (← links)
- The annulation threshold for partially monotonic automata (Q845077) (← links)
- Pure future local temporal logics are expressively complete for Mazurkiewicz traces (Q859824) (← links)
- Languages polylog-time reducible to dot-depth 1/2 (Q859980) (← links)
- Two algebraic approaches to variants of the concatenation product (Q861283) (← links)
- Products of languages with counter (Q917324) (← links)
- On aperiodic and star-free formal power series in partially commuting variables (Q927397) (← links)
- Logic and rational languages of words indexed by linear orderings (Q987379) (← links)
- Classifying regular languages by a split game (Q1022599) (← links)
- Star-free sets of integers (Q1079381) (← links)
- Characterizations of some classes of regular events (Q1083210) (← links)
- Semigroups and languages of dot-depth two (Q1109125) (← links)
- Inverse monoids of dot-depth two (Q1124363) (← links)
- Monoides pointes (Q1132637) (← links)
- Series formelles et algèbres syntactiques (Q1144951) (← links)
- Languages of R-trivial monoids (Q1146010) (← links)
- A generalization of the Schützenberger product of finite monoids (Q1150445) (← links)
- Classification of finite monoids: the language approach (Q1157412) (← links)
- Complete systems of \(\mathcal B\)-rational identities (Q1177930) (← links)
- Regular languages in \(NC\) (Q1191027) (← links)
- Star-free trace languages (Q1193878) (← links)
- On a conjecture concerning dot-depth two languages (Q1200802) (← links)
- Games, equations and dot-depth two monoids (Q1201097) (← links)
- More languages of generalised star height 1 (Q1202929) (← links)
- Some results on the dot-depth hierarchy (Q1207707) (← links)
- Some results on the generalized star-height problem (Q1207944) (← links)
- The Burnside problem for semigroups (Q1215588) (← links)
- A generalization of finiteness (Q1236192) (← links)
- Properties of code events and homomorphisms over regular events (Q1237764) (← links)
- The dot-depth hierarchy of star-free languages is infinite (Q1242697) (← links)
- La finitude des représentations linéaires des semi-groupes est decidable (Q1245319) (← links)
- Un algorithme calculant le cardinal, fini ou infini, des demi-groupes de matrices (Q1250142) (← links)
- Sur le monoide syntactique de \(L^*\)lorsque L est un langage fini (Q1250514) (← links)
- Variétés de langages et opérations (Q1254109) (← links)
- Cyclotomic polynomials and unions of groups (Q1256865) (← links)
- The join of the pseudovarieties of \(\mathcal R\)-trivial and \(\mathcal L\)-trivial monoids (Q1262959) (← links)
- A conjugacy invariant for reducible sofic shifts and its semigroup characterizations (Q1269771) (← 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)
- Modulo-counting quantifiers over finite trees (Q1325850) (← links)