Two algebraic approaches to variants of the concatenation product
type: Item
instance of: scholarly article
title: Two algebraic approaches to variants of the concatenation product
zbMATH Open document ID: 1140.68024
author: Mário J. J. Branco
published in: Theoretical Computer Science
publication date: 2007-01-09T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 06F05
zbMATH DE Number: 5083801
zbMATH Keywords: rational language
zbMATH Keywords: concatenation
zbMATH Keywords: monoid
zbMATH Keywords: variety
MaRDI profile type: Publication
full work available at URL: j.tcs.2006.09.017
OpenAlex ID: W2050745421
cites work: Q4407421
cites work: Q3123634
cites work: Iteration of expansions. Unambiguous semigroups
cites work: Almost finite expansions of arbitrary semigroups
cites work: Equations on the semidirect product of a finite semilattice by a $\mathcal {J}$-trivial monoid of height $k$
cites work: Trees, congruences and varieties of finite semigroups
cites work: Varieties of ordered algebras
cites work: The Kernel Category and Variants of the Concatenation Product
cites work: Languages of R-trivial monoids
cites work: Actions, wreath products of \(\mathcal C\)-varieties and concatenation product.
cites work: Q4132170
cites work: Semigroup expansions using the derived category, kernel, and Malcev products
cites work: Q4453870
cites work: Q4271190
cites work: Q3894956
cites work: On semidirect products of two finite semilattices
cites work: Q3776657
cites work: Eilenberg's theorem for positive varieties of languages
cites work: Q4219038
cites work: Algebraic tools for the concatenation product.
cites work: Some results onC-varieties
cites work: Locally trivial categories and unambiguous concatenation
cites work: THE BIDETERMINISTIC CONCATENATION PRODUCT
cites work: A Reiterman theorem for pseudovarieties of finite first-order structures
cites work: Polynomial closure and unambiguous product
cites work: A conjecture on the concatenation product
cites work: THE WREATH PRODUCT PRINCIPLE FOR ORDERED SEMIGROUPS
cites work: The Birkhoff theorem for finite algebras
cites work: Infinite iteration of matrix semigroups. II: Structure theorem for arbitrary semigroups up to aperiodic morphism
cites work: The kernel of monoid morphisms
cites work: Decomposition techniques for finite semigroups, using categories. II
cites work: On finite monoids having only trivial subgroups
cites work: Sur le produit de concatenation non ambigu
cites work: POLYNOMIAL CLOSURE AND TOPOLOGY
cites work: Q3044353
cites work: Q4407441
cites work: Categories as algebra: An essential ingredient in the theory of monoids
cites work: Q4002149
cites work: Products of languages with counter
cites work: Closure of varieties of languages under products with counter
DOI: 10.1016/J.TCS.2006.09.017
description: scientific article; zbMATH DE number 5083801