Automatic semigroup

In mathematics, an automatic semigroup is a finitely generated semigroup equipped with several regular languages over an alphabet representing a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
We construct reduced and full semigroup C*-algebras for left cancellative semigroups. Our new construction covers particular… (More)
Is this relevant?
2011
2011
The concept of an automatic structure has been generalized from groups [ECH+] to semigroups [CRRT]. Several authors [CRR… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We combine Malliavin calculus with Stein’s method, in order to derive explicit bounds in the Gaussian and Gamma approximations of… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Suppose that A is a C-algebra for which A ∼= A ⊗ Z, where Z is the Jiang–Su algebra: a unital, simple, stably finite, separable… (More)
Is this relevant?
2007
2007
Throughout this paper, letH be a real Hilbert space with inner product 〈·,·〉 and ‖ · ‖. We use xn⇀ x to indicate that the… (More)
Is this relevant?
2007
2007
We consider a diffusion problem on a network on whose nodes we impose Dirichlet and generalized, non-local Kirchhoff-type… (More)
Is this relevant?
2005
2005
We consider biautomatic semigroups. There are two different definitions of a biautomatic structure for a group in the literature… (More)
Is this relevant?
2002
2002
The notion of “automaticity” has been widely studied in groups (see [1, 8] for example), and some progress has been made in… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
This paper is concerned with the many deep and far reaching consequences of Ash's positive solution of the type II conjecture for… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?