On semidirect and two-sided semidirect products of finite $\mathcal {J}$trivial monoids
From MaRDI portal
Publication:3126014
DOI10.1051/ita/1996300504571zbMath0906.20039MaRDI QIDQ3126014
Publication date: 9 December 1998
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92546
semidirect products; pseudovarieties of monoids; finite aperiodic monoids; finite semilattice monoids; locally finite pseudovarieties
68W30: Symbolic computation and algebraic computation
20M07: Varieties and pseudovarieties of semigroups
20M05: Free semigroups, generators and relations, word problems
08A70: Applications of universal algebra in computer science
08B20: Free algebras
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Categories as algebra: An essential ingredient in the theory of monoids
- Equations and dot-depth one
- On semidirect products of two finite semilattices
- The kernel of monoid morphisms
- First-order logic and star-free sets
- Languages of R-trivial monoids
- The Birkhoff theorem for finite algebras
- Classifying regular events in symbolic logic
- On iterated semidirect products of finite semilattices
- On a conjecture concerning dot-depth two languages
- Games, equations and dot-depth two monoids
- Closure of varieties of languages under products with counter
- On pseudovarieties
- The dot-depth hierarchy of star-free languages is infinite
- Semidirect products of pseudovarieties from the universal algebraist's point of view
- Equations and monoid varieties of dot-depth one and two
- On a complete set of generators for dot-depth two
- Equations on the semidirect product of a finite semilattice by a finite commutative monoid
- Games, equations and the dot-depth hierarchy
- Some logical characterizations of the dot-depth hierarchy and applications
- Free profinite semigroups over semidirect products
- Inclusion relations between some congruences related to the dot-depth hierarchy
- Finite semigroup varieties of the form V*D
- Dot-depth of star-free events
- An application of games to the completeness problem for formalized theories
- An application of the Ehrenfeucht-Fraisse game in formal language theory
- Undecidability of the identity problem for finite semigroups
- THE DOT-DEPTH OF A GENERATING CLASS OF APERIODIC MONOIDS IS COMPUTABLE
- Equations on the semidirect product of a finite semilattice by a $\mathcal {J}$-trivial monoid of height $k$
- On dot-depth two