Results 171 to 180 of about 760 (210)

A Martingale-Free Introduction to Conditional Gaussian Nonlinear Systems. [PDF]

Entropy (Basel)
Andreou M, Chen N.
europepmc   +1 more source

STABILIZED BACKWARD IN TIME EXPLICIT MARCHING SCHEMES IN THE NUMERICAL COMPUTATION OF ILL-POSED TIME-REVERSED HYPERBOLIC/PARABOLIC SYSTEMS. [PDF]

Inverse Probl Sci Eng, 2019
Carasso AS.
europepmc   +1 more source

Geometric aspects of biological sequence comparison. [PDF]

J Comput Biol, 2009
Stojmirović A, Yu YK.
europepmc   +1 more source

On the holonomy decomposition of transformation semigroups

Theoretical Computer Science, 1982
openaire   +1 more source

Representations of semigroups by linear transformations: Part II

Semigroup Forum, 1971
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Locally Factorisable Transformation Semigroups

Southeast Asian Bulletin of Mathematics, 2001
A semigroup \(S\) is called factorizable if \(S=GE=EG\) where \(G\) is a subgroup of \(S\) and \(E\) is its set of idempotents; \(S\) is locally factorizable if \(eSe\) is factorizable for every idempotent \(e\). Suppose \(S\) is a subsemigroup of the partial transformation semigroup \(P(X)\) with identity \(\varepsilon\).
R P Sullivan
exaly   +3 more sources

Set products in transformation semigroups

Proceedings of the Royal Society of Edinburgh: Section A Mathematics, 2003
We describe products of arbitrary L-, R- and H-classes with the set of idempotents of full transformation semigroups.
Higgins, Peter M., Howie, John M., Ruškuc, Nik   +2 more
openaire   +2 more sources

Transformation Semigroups for Rough Sets

Lecture Notes in Computer Science, 2018
In this article we define transformation semigroups for rough sets. Basic constructions such as closures, products, coverings and partitions for transformation semigroups are defined. A decomposition theorem for reset transformation semigroups is given. A connection with automata is also presented by defining a semiautomaton for rough sets.
Anuj Kumar More, Mohua Banerjee, Banerjee Mohua   +2 more
exaly   +2 more sources

Derived Rees Matrix Semigroups as Semigroups of Transformations

Semigroup Forum, 2006
An ordered pair (e,f) of idempotents of a regular semigroup is called a skew pair if ef is not idempotent whereas fe is idempotent. Previously [1] we have established that there are four distinct types of skew pairs of idempotents. We have also described (as quotient semigroups of certain regular Rees matrix semigroups [2]) the structure of the ...
T.S. Blyth, M.H. Almeida Santos
openaire   +2 more sources