Skip to search formSkip to main contentSkip to account menu

Automatic semigroup

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Abstract We examine the ranks of operators in semi-finite ${{C}^{*}}$ -algebras as measured by their densely defined lower… 
2011
2011
AbstractIn this paper, we show the hierarchical convergence of the following implicit double-net algorithm: xs,t=s[tf(xs,t)+(1-t… 
2011
2011
Let C be a complete non-singular curve of genus 3 over an algebraically closed field of characteristic 0. We determine all… 
Highly Cited
2008
2006
2006
We study necessary and sufficient conditions for an accretive operator which satisfies the range condition to have a zero. We… 
Highly Cited
2003
Highly Cited
2003
In these notes we report on recent progress in the theory of hypercyclic and chaotic operators. Our discussion will be guided by… 
1994
1994
A complete description of ultrarepetitive semigroups is given. As an application of this result all semigroups S are described… 
Highly Cited
1952
Highly Cited
1952