Algorithmic aspects of finite semigroup theory, a tutorial
Texte intégral
Documents relatifs
The aim of the present paper is ( i ) to present general results about freeness problems, ( ii ) to study the decidability of freeness problems over various particular
Informatique théorique/Theoretical Informaties (vol. — It is shown that one can décide whether a langage has dot-depth one in the dot-depth hierarchy introduced by BrzozowskL
As we said in the first section a subsemigroup A of X + is itself free if and only if A is free in X +. Informatique théorique/Theoretical Informaties.. In fact, otherwise,
Starting from integral operators with Gaussian kernels on ^(R 71 ) Howe constructed in [How2] a semigroup of contractions whose closure contained the metaplectic representation
In 1986, Sen and Saha [17] defined Γ-semigroup as a generalization of semigroup and ternary semigroup as follows:..
Xin Li, motivated by the study of ring C*-algebras, gives in [Li12] a new definition of the full semigroup C*-algebra of a discrete cancellative semigroup (and of full crossed
de Pagter, Certain semigroups on Banach function spaces and their adjoints, In: Semigroup Theory and Evolution Equations. Lecture Notes in Pure and Applied Mathematics,
Finite element method, degenerate parabolic equation, nonlinear semigroup.. 1 Department of Mathematics, Faculty of Science, Gakushuin University, 1-5-1 Mejiro, Toshima-ku,