In this paper we introduced homomorphism, strong homomorphism in bipolar fuzzy finite state machines and discuss their properties using bipolar-valued fuzzy set. Mathematics Subject Classification: 18B20, 68Q45, 68Q70, 03E72

It is not difficult to see that every group homomorphism from Z to R extends to a homomorphism from R to R. We discuss other examples of discrete subgroups Γ of connected Lie groups G, such that the homomorphisms defined on Γ can (“virtually”) be extended to homomorphisms defined on all of G. For the case where G is solvable, we give a simple proof that Γ has this property if it is Zariski dens...

in this paper, we introduce n-jordan homomorphisms and n-jordan *-homomorphisms and also investigate the hyers-ulam-rassiasstability of n-jordan *-homomorphisms on c*-algebras.

in this paper, we present algebroids and crossed modules of algebroids. we also define pullbackcrossed module of algebroids.

‎In this paper‎, ‎we prove that the category of crossed polymodules (i.e‎. ‎crossed modules of polygroups) and their morphisms is finitely complete‎. ‎We‎, ‎therefore‎, ‎generalize the group theoretical case of this completeness property of crossed modules‎.

For digraphs D and H, a mapping f : V (D)→V (H) is a homomorphism of D to H if uv ∈ A(D) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (D) is associated with costs ci(u), i ∈ V (H), then the cost of the homomorphism f is ∑ u∈V (D) cf(u)(u). For each fixed digraph H, we have the minimum cost homomorphism problem for H. The problem is to decide, for an input graph D with costs ci(u), u...

For digraphs D and H , a mapping f : V (D)→V (H) is a homomorphism of D to H if uv ∈ A(D) implies f(u)f(v) ∈ A(H). For a fixed directed or undirected graph H and an input graph D, the problem of verifying whether there exists a homomorphism of D to H has been studied in a large number of papers. We study an optimization version of this decision problem. Our optimization problem is motivated by ...