On finite monoids having only trivial subgroups

Cited in

(only showing first 100 items - show all)

Classifying regular languages by a split game
Star-free sets of integers
Characterizations of some classes of regular events
Semigroups and languages of dot-depth two
Inverse monoids of dot-depth two
Monoides pointes
Series formelles et algèbres syntactiques
Languages of R-trivial monoids
A generalization of the Schützenberger product of finite monoids
Classification of finite monoids: the language approach
Complete systems of \(\mathcal B\)-rational identities
Regular languages in \(NC\)
Star-free trace languages
On a conjecture concerning dot-depth two languages
Games, equations and dot-depth two monoids
More languages of generalised star height 1
Some results on the dot-depth hierarchy
Some results on the generalized star-height problem
The Burnside problem for semigroups
A generalization of finiteness
Properties of code events and homomorphisms over regular events
The dot-depth hierarchy of star-free languages is infinite
La finitude des représentations linéaires des semi-groupes est decidable
Un algorithme calculant le cardinal, fini ou infini, des demi-groupes de matrices
Sur le monoide syntactique de \(L^*\)lorsque L est un langage fini
Variétés de langages et opérations
Cyclotomic polynomials and unions of groups
The join of the pseudovarieties of \(\mathcal R\)-trivial and \(\mathcal L\)-trivial monoids
A conjugacy invariant for reducible sofic shifts and its semigroup characterizations
Trees, congruences and varieties of finite semigroups
Equations and monoid varieties of dot-depth one and two
On a complete set of generators for dot-depth two
Modulo-counting quantifiers over finite trees
Polynomial closure and unambiguous product
Some decisional problems on rational relations
Simple splicing systems
An algebraic approach to data languages and timed languages
Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata.
Alternating finite automata and star-free languages
Programs over semigroups of dot-depth one
LANGAGE: A Maple package for automaton characterization of regular languages
Logic over words on denumerable ordinals
The word problem for omega-terms over the Trotter-Weil hierarchy
Left and right negatively orderable semigroups and a one-sided version of Simon's theorem
Problems on finite automata and the exponential time hypothesis
Applications of realizations (aka linearizations) to free probability
Towards a pseudoequational proof theory
Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups
Local temporal logic is expressively complete for cograph dependence alphabets
Synchronizing generalized monotonic automata
Expressive power of existential first-order sentences of Büchi's sequential calculus
Classes of languages generated by the Kleene star of a word
Logic, semigroups and automata on words
Games, equations and the dot-depth hierarchy
Sur les monoides dont tous les groupes sont resolubles
Algebraic tools for the concatenation product.
An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic
Star-free sets of words on ordinals
Towards a language theory for infinite N-free pomsets.
Bilateral locally testable languages.
Unary algebras, semigroups and congruences on free semigroups
Vectorial languages and linear temporal logic
The finite basis problem in the pseudovariety joins of aperiodic semigroups with groups
Inclusion relations between some congruences related to the dot-depth hierarchy
A trichotomy for regular simple path queries on graphs
A categorical duality for algebras of partial functions
Weighted automata
Varieties
State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages
Closure properties of subregular languages under operations
The lattice of varieties of monoids
Operations on subregular languages and nondeterministic state complexity
Regularity conditions for iterated shuffle on commutative regular languages
State complexity of permutation and related decision problems on alphabetical pattern constraints
Axiomatizing recursion-free, regular monitors
Measuring power of locally testable languages
Learning from positive and negative examples: dichotomies and parameterized algorithms
Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy
On language varieties without Boolean operations
Finite semigroup varieties of the form V*D
Determination of finite automata accepting subregular languages
Pro-aperiodic monoids via saturated models
A topological approach to non-uniform complexity
Generic results for concatenation hierarchies
Omega-rational expressions with bounded synchronization delay
Concatenation-free languages
On the expressive power of temporal logic
Weighted automata and weighted logics
Concatenation hierarchies: new bottle, old wine
The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy
Languages of dot-depth 3/2
Algebraic recognizability of regular tree languages
Actions, wreath products of \(\mathcal C\)-varieties and concatenation product.
Characterizing EF and EX tree logics
The structure of finite monoids satisfying the relation \(\mathcal R=\mathcal H\).
On the pseudovariety generated by all finite monoids satisfying \(\mathcal R=\mathcal H\).
Locally testable languages
Positive varieties of tree languages
The many faces of a translation
Characterization of the pseudovariety generated by finite monoids satisfying \(\mathcal R=\mathcal H\).

This page was built for publication: On finite monoids having only trivial subgroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5339335)