具有极大因分解的半模和半环.pdfVIP

Á ‡ \ gÄÅ´˜aA^2Åì, kG gÄŌ ±wŠAÏ\ gÄÅ. · ‚ §z‡k G gÄÅÑdu˜‡(½k  gÄÅ, ¿šz‡\k  g ÄÅÑdu˜‡(½\k  gÄÅ.  ïƘ‡\ gÄÅd(½\ gÄÅ35, Kirsten Ú M¨aurer Ú\ Œ‚þk‘4ŒÏª©)Vg. 3© ¥, ·‚Äk½Â Œ 4Œ Ϫ©), ‰ Ñ äk4Œ Ϫ©) Œ x: ˜‡ K-Œ M äk4ŒÏª©)…= M ?¿šÑk˜‡m M- Ïf. X, ·‚òŒ‚wŠAÏŒ, x äkk‘4ŒÏª©)Œ‚A , ¿éŒ‚þk ‘4ŒÏª©)?1 ©a. , ·‚y ² ˜‡F-Œž K-Œ  M äk4ŒÏª©)…= M ∗ ?¿Ñk˜‡Œ† K- Ïf, ¿(½ äk 4ŒÏª©) Œþ¤k4ŒÏª©). A^ù (Ø, ·‚„?˜Ú äk k ‘4ŒÏª©) ¦{mžŒ‚ A, ¿(½ ù Œ‚þ¤kk ‘4ŒÏ ª©). …c: Œ, Œ‚, 4ŒÏª©), m M- Ïf, ̂ 0-†©), 4Œ«m O-† ¿, F-ŒžŒ, Œ† M- Ïf, g.c.l.d.^‡. I ABSTRACT Weighted finite automata is a class of machines which can be used in many cate- gories. Finite state automata can be seen as special weighted finite automata. It is well known that each finite state automaton is equivalent to a determinate finite automaton. Unfortunately, not any weighted finite automaton is equivalent to a determinate weighted finite automaton. To consider the existence of the determination of a weighted finite automaton, Kirsten introduced the notion of a maximal factorization of a semiring. In this paper, we first define the notion of a maximal factorization of a semimodule, and describe the characterizations of semimodules admitting a maximal factorization: A K-semimodule M admits a maximal factorization if and only if each non-zero element of M has a least right M-divisor. Next, considering each semiring as a special semimodule, we determine the semirings admitting a maximal factorization, and classify the maximal factorizations of such a semiring. At last, we prove that an F -cancellative K-semimodule M admits a maximal factorization if and only if each element of