Automatic semigroup

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

A semigroup $T$ is called Taimanov if $T$ contains two distinct elements $0,\infty$ such that $xy=\infty$ for any distinct points…

2012

We initiate the study of interval-valued fuzzy quasi-ideal of a semigroup. In Section 2, we list some basic definitions in the…

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

Let C be a complete non-singular curve of genus 3 over an algebraically closed field of characteristic 0. We determine all…

2009

Let ${\cal E}$ be a Dirichlet form on $L_2(X)$ and $\Omega$ an open subset of $X$. Then one can define Dirichlet forms ${\cal E…

2009

2008

Abstract Kublanovsky has shown that if a subvariety V of the variety RSn generated by completely 0-simple semigroups over groups…

2006

We study necessary and sufficient conditions for an accretive operator which satisfies the range condition to have a zero. We…

2001

We propose a methodology for the determination of the range of option prices of a European option in a general semimartingale…

1994

A complete description of ultrarepetitive semigroups is given. As an application of this result all semigroups S are described…