Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Automatic group

Known as: Biautomatic group 
In mathematics, an automatic group is a finitely generated group equipped with several finite-state automata. These automata represent the Cayley… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
The recent advancement of social media has given users a platform to socially engage and interact with a larger population… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2015
2015
This paper shows that every Plactic algebra of finite rank admits a finite Grobner–Shirshov basis. The result is proved by using… Expand
Is this relevant?
2011
2011
Sparse Coding (SC), which models the data vectors as sparse linear combinations over basis vectors (i.e., dictionary), has been… Expand
  • figure 3
  • figure 4
  • figure 1
  • figure 2
  • figure 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
One goal of collaborative learning is to maximize the learning performance of all participating students. In order to achieve… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The navigation activity is an every day practice for any human being capable of locomotion. Our objective in this work is to… Expand
Is this relevant?
2003
2003
AbstractThe complement of the hyperplane arrangement associated to the (complexified) action of a finite, real reflection group… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Resume Les monoides de Garside sont introduits comme monoides simplifiables ou existent ppcm et pgcd et ou sont satisfaites des… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 3.1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We study definability and complexity issues for automatic and /spl omega/-automatic structures. These are, in general, infinite… Expand
Is this relevant?
Highly Cited
1999
Highly Cited
1999
It is known that a number of algebraic properties of the braid groups extend to arbitrary finite Coxeter-type Artin groups. Here… Expand
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Centralizers of finite subsets in biautomatic groups are them- selves biautomatic. Every polycyclic subgroup of a biautomatic… Expand
Is this relevant?