Results 91 to 100 of about 760 (210)

The Algebraic View of Computation: Implementation, Interpretation and Time

open access: yesPhilosophies, 2018
Computational implementations are special relations between what is computed and what computes it. Though the word “isomorphism” appears in philosophical discussions about the nature of implementations, it is used only metaphorically. Here we
Attila Egri-Nagy
doaj   +1 more source

On generators, relations and D-simplicity of direct products, Byleen extensions, and other semigroup constructions [PDF]

open access: yes, 2015
In this thesis we study two different topics, both in the context of semigroup constructions. The first is the investigation of an embedding problem, specifically the problem of whether it is possible to embed any given finitely presentable semigroup ...
Baynes, Samuel
core  

Particular case of operator calculus for generalized functions with supports in cone

open access: yesKarpatsʹkì Matematičnì Publìkacìï, 2009
In this work the construction of functional calculus for strongly continuous semigroups of operators in Schwartz distribution algebra on some cone is generalized.
A. V. Solomko
doaj  

Commutative nilpotent transformation semigroups [PDF]

open access: yes
Funding Information: This work is funded by national funds through the FCT\u2014Funda\u00E7\u00E3o para a Ci\u00EAncia e a Tecnologia, I.P., under the scope of the projects UIDB/00297/2020 and UIDP/00297/2020 (Center for Mathematics and Applications ...
Malheiro, António   +2 more
core   +1 more source

Natural Partial Order on Generalized Semigroups of Transformation Semigroups That Preserve Order and an Equivalence Relation

open access: yesJournal of Mathematics
Let X be a finite total order set and E be a convex equivalence relation on X. We denote that OEX=f∈TEX:∀x,y∈X,x≤y⟹fx≤fy , where TEX is an E− preserving transformation semigroup.
Meiqing Qin, Xuerong Fu
doaj   +1 more source

Standard automata and semidirect products of transformation semigroups [PDF]

open access: yes, 1993
We propose a decomposition of transformation semigroups (X, S) on a finite set X that provides 1.a composition of its elements out of idempotents/generators,2.a way by which S is obtained from semilattices/cyclic groups acting on X, namely by means of ...
Kunze, Michael
core   +1 more source

Co-annihilating graphs of partial transformation semigroups: structure and basic invariants

open access: yesArab Journal of Basic and Applied Sciences
Let [Formula: see text] and [Formula: see text] Denote by [Formula: see text] the partial transformation semigroup on [Formula: see text] Clearly, the empty set [Formula: see text] is a zero element of [Formula: see text] which is written as 0.
Chollawat Pookpienlert   +2 more
doaj   +1 more source

Transformation Semigroups and State Machines [PDF]

open access: yes, 2019
A transformation semigroup is a pair (QS) consisting of a finite set Q, a finite semigroupS and a semigroup action ? : Q X S?Q, (q, s ?s(q) which means : i) ?
Jawatankuasa Kerja PSM UniMAP
core  

Automorphisms and range families of transformation semigroups [PDF]

open access: yes, 1984
The problem of describing all automorphisms of a given semigroup of transformations of a set X has interested a number of mathematicians in the past fifty years. J. Schreier showed that all automorphisms of the full transformation semigroup T“ are inner,
Levi, Inessa
core   +1 more source

Home - About - Disclaimer - Privacy