Results 201 to 210 of about 14,027 (232)
Some of the next articles are maybe not open access.
Homomorphisms and inverse homomorphisms on graph-walking automata
Theoretical Computer Science, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Olga Martynova 0001, Alexander Okhotin
openaire +2 more sources
The Annals of Mathematics, 1941
=, + G2 + * *= En Gp, I H = H1+ H2 + * = ZHP Gp Gq = Ox Hp Hq = O (p 5 iq) where the notation is not to be taken to mean that the sets are denumerable; the elements of a set Gp will be denoted by gp, gp, .. . . Then G is said to be homomorphic to H, G H, if (1) gpgq =gr D HpHq _ Hr.
openaire +2 more sources
=, + G2 + * *= En Gp, I H = H1+ H2 + * = ZHP Gp Gq = Ox Hp Hq = O (p 5 iq) where the notation is not to be taken to mean that the sets are denumerable; the elements of a set Gp will be denoted by gp, gp, .. . . Then G is said to be homomorphic to H, G H, if (1) gpgq =gr D HpHq _ Hr.
openaire +2 more sources
Derivations as Homomorphisms or Anti-homomorphisms on Lie Ideals
Acta Mathematica Sinica, English Series, 2006The authors show that if a derivation \(D\) of a prime ring \(R\) with \(\text{char\,}R\neq 2\), acts like a (anti-) homomorphism on a noncentral Lie ideal of \(R\), then \(D=0\).
Wang, Yu, You, Hong
openaire +2 more sources
Stores as homomorphisms and their transformations
1993We address the problem of giving a clean and uniform mathematical model for handling user-defined data types in imperative languages, contrary to the ad hoc treatment usual in classical denotational semantics. The problem is solved by defining the store as a homomorphic mapping of an algebraic structure of left values modelling containers into another ...
ASTESIANO, EGIDIO +2 more
openaire +4 more sources
On the suspension homomorphism
2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
DRAGOTTI, SARA +2 more
openaire +2 more sources
Homomorphisms and promotability
1989The construction of structure-preserving maps, or “homomorphisms,” is described for an arbitrary data type: examples of these functions are given for list- and tree-like structures and types defined by mutual induction. From the definition of a data type it is also possible to infer a “promotion” theorem for proving equalities of homomorphisms.
openaire +3 more sources
Polynomially dependent homomorphisms and frobenius n-homomorphisms
Proceedings of the Steklov Institute of Mathematics, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Relations Between n-Jordan Homomorphisms and n-Homomorphisms
Bulletin of the Iranian Mathematical Society, 2021Taher Ghasemi Honary
exaly

