1) congruence
[英]['kɔŋgruəns] [美]['kɑŋgrʊəns]
同余
1.
Upper and Lower Approximation Based on Congruences on Linear Spaces;
线性空间上基于同余的上(下)近似
2.
A characterization of skew-ring congruences on a class of semirings;
一类半环的skew-环同余的刻画
2) congruences
同余
1.
The Congruences and Homomorphisms of Lattice-valued Mealy-type Machines;
格值Mealy自动机的同余和同态
2.
Ideals of Quantales and Congruences Generated by Ideals
Quantale的理想及由理想生成的同余
3.
The notion congruences and homomorphisms of Lattice-valued fuzzy finite automata is proposed,investigates some algebraic properties of congruences and homomorphisms about these automata.
给出了格值自动机的同余和同态,从代数角度出发详细研究了同余和同态关系的代数性质,揭示了格值自动机的代数性质和取值格半群的紧密联系,利用同余和同态关系最终研究了格值自动机的极小化问题,在正则同余下给出了可在有限步实现具有模糊初始状态和特殊模糊终状态的自动机极小化的算法。
3) congruent
[英]['kɔŋɡruənt] [美]['kɑŋgruənt]
同余
1.
Non-congruent Presentations for Certain Primitive Complex Reflection Groups;
某些本原复反射群的不同余表出
2.
This paper introduces a new method of sieve, after deleting those parameter set from complete residue system of prime modulus which are congruent with starting points,combined to last residual set sifted n times.
引入一种新筛法,通过在素数模的完全剩余系中划掉与起点同余的参数集,组合出经由n次筛减后的剩余数集。
4) superfluous congruence
富余同余
1.
In this paper,the essential congruences and superfluous congruences of left S-acts are defined.
本文给出了S-系上本质同余与富余同余的概念,并刻画了它们的性质;利用与模论中研究本质子模与余子模相类似的方法,得到了与其相类似的结果。
5) S-lattices congruence
S-格同余
1.
The act of an ordered semigroup on a poset is extended into a lattice ordered semigroup on a lattice;the notion of S-lattices is introduced;and the properties of S-lattices congruence and S-lattices morphism are discussed to develop the representation theorems of lattice ordered semigroups.
将序半群在偏序集上的作用推广到格半群在格上的作用,提出了S-格的定义并讨论了S-格同态和S-格同余的性质,得到了格半群的表示定理。
6) congruence
[英]['kɔŋgruəns] [美]['kɑŋgrʊəns]
同余式
1.
Some congruences concerning Euler numbers;
关于Euler数的一些同余式
2.
The note to the solutions of the congruence 2~(n-2)≡1(mod n);
关于同余式2~(n-2)≡1(mod n)的解的注记
3.
Solution on the congruence 2~n≡5(mod n);
关于同余式2~n≡5(mod n)的解
补充资料：同余
| 同余 congruence 给定一个正整数m，把它叫做模。如果用m去除任意两个整数a与b所得的余数相同，就说a、b对模m同余，记作a≡b（mod m）。如果余数不同，就说a、b对模m不同余，记作a  b（mod m）。 |
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条