No.1268
‘㐔Œn‚ΜƒAƒ‹ƒSƒŠƒYƒ€‚ΖŒvŽZ˜_
Algorithms in Algebraic Systems and Computation Theory
Œ€‹†W‰ο•ρW
@
2002/02/20`2002/02/22
¬—с@‚δ‚€Ž‘
Yuji Kobayashi
@
–ځ@ŽŸ
@
1. $n$-Insertion on Languages (Algorithms in Algebraic Systems and Computation Theory)-----------------------------------------------1
@@@@‹ž“sŽY‹Ζ‘εŠw—Šw•”/‹ž“sŽY‹Ζ‘εŠw—ŠwŒ€‹†‰Θ@@@ˆΙ“‘ ³”ό/™‰Y —Ί@(Ito,Masami/Sugiura,Ryo)
@
2. A Language Equation and Its Applications (Algorithms in Algebraic Systems and Computation Theory)---------------------------------7
@@@@‹ž“sŽY‹Ζ‘εŠw—Šw•”@@@ˆΙ“‘ ³”ό@(Ito,Masami)
@
3. Some Remarks on Sequence Design for DNA Computing : Abstract (Algorithms in Algebraic Systems and Computation Theory)------------11
@@@@“d‹C’ʐM‘εŠw/“d‹C’ʐM‘εŠw@@@¬—Ρ ‘/‹ί“‘ •ό‘ε@(Kobayashi,Satoshi/Kondo,Tomohiro)
@
4. On Public-Key Cryptosystems against Chosen Cipertext Attack (Algorithms in Algebraic Systems and Computation Theory)-------------17
@@@@•xŽm’ΚŒ€‹†Š@@@¬ŽΔ Œ’Žj@(Koshiba,Takeshi)
@
5. A Parallelized Elliptic Curve Multiplication and its Resistance against Side-Channel Attacks (Algorithms in Algebraic Systems and Computation Theory)---29
@@@@•xŽm’ΚŒ€‹†Š/ƒ_ƒ‹ƒ€ƒVƒ…ƒ^ƒbƒgH‰Θ‘εŠw@@@ˆΙ“€ “N–η/‚–Ψ „@(Izu,Tetsuya/Takagi,Tsuyoshi)
@
6. Formal Language Theoretical Approach to Secret Sharing Schemes (Algorithms in Algebraic Systems and Computation Theory)----------40
@@@@’ʐM‘‡Œ€‹†Š/’ʐM‘‡Œ€‹†Š@@@ŽR‘Ί –ΎO/‘κΰV C@(Yamamura,Akihiro/Takizawa,Osamu)
@
7. Remarks on locally inverse *-semigroups (Algorithms in Algebraic Systems and Computation Theory)---------------------------------47
@@@@“‡ͺ‘εŠw‘‡—HŠw•”/“‡ͺ‘εŠw‘‡—HŠw•”@@@‘‰ͺ ‹P’j/“‘Œ΄ _Ž¦@(Imaoka,Teruo/Fujiwara,Koji)
@
8. THE NORMAL OPEN SET ALMOST EQUAL TO A REGULAR OMEGA LANGUAGE (Algorithms in Algebraic Systems and Computation Theory)------------50
@@@@“Œ–M‘εŠw—Šw•”ξ•ρ‰ΘŠw‰Θ@@@’|“ΰ ς@(Takeuti,Izumi)
@
9. On cellular automata (Algorithms in Algebraic Systems and Computation Theory)----------------------------------------------------59
@@@@“Œ—m‘εŠwHŠw•”ξ•ρHŠw‰Θ@@@²“‘ ’‰ˆκ@(Sato,Tadakazu)
@
10. Graph Rewriting in Topology IV : Rewriting Based on Algebraic Operators (Algorithms in Algebraic Systems and Computation Theory)---64
@@@@ATRlŠΤξ•ρ‰ΘŠwŒ€‹†Š/ATRlŠΤξ•ρ‰ΘŠwŒ€‹†Š@@@/‰ΊŒ΄ ŸŒ›@(Liu,Jian-Qin/Shimohara,Katsunori)
@
11. LEXICOGRAPHIC GROBNER BASES OF TORIC IDEALS ARISING FROM ROOT SYSTEMS (Algorithms in Algebraic Systems and Computation Theory)---73
@@@@—§‹³‘εŠw—Šw•””Šw‰Θ@@@‘吙 ‰pŽj@(Ohsugi,Hidefumi)
@
12. Numerical semigroups of toric type of higher dimension (Algorithms in Algebraic Systems and Computation Theory)-----------------77
@@@@_“ސμH‹Ζ‘εŠw@@@•Δ“c “ρ—ǁ@(Komeda,Jiryo)
@
13. Average number of connected components and free resolutions of Stanley-Reisner rings (Algorithms in Algebraic Systems and Computation Theory)---81
@@@@²‰κ‘εŠw•Ά‰»‹³ˆηŠw•”@@@Ž›ˆδ ’ΌŽχ@(Terai,Naoki)
@
14. On the Unit Group of a Semigroup Ring (Algorithms in Algebraic Systems and Computation Theory)----------------------------------97
@@@@ˆοι‘εŠw—Šw•”@@@Ό“c —²‹P@(Matsuda,Ryuki)
@
15. The word problem for the braid inverse monoid (Algorithms in Algebraic Systems and Computation Theory)-------------------------105
@@@@“Œ–M‘εŠw—Šw•”ξ•ρ‰ΘŠw‰Θ/“Œ–M‘εŠw—Šw•”ξ•ρ‰ΘŠw‰Θ/“Œ–M‘εŠw—Šw•”ξ•ρ‰ΘŠw‰Θ@@@ˆξ“c —E/•ΠŠC ’ΌŽχ/”ς“c ‹œr@(Inata,Isamu/Kataumi,Naoki/Tobita,Takatoshi)
@
16. On the structure of weak interlaced bilattice $\mathcal{K}(\rm{L})$ (Algorithms in Algebraic Systems and Computation Theory)---110
@@@@“‡ͺ‘εŠw‘‡—HŠw•”@@@‹ί“‘ ’Κ˜N@(Kondo,Michiro)
@
17. $\gamma$-Calculus with Lazy Lists : Extended abstract (Algorithms in Algebraic Systems and Computation Theory)-----------------118
@@@@“‡ͺ‘εŠw‘‡—HŠw•”@@@“‘“c Œ›‰x@(Fujita,Ken-etsu)
@
18. Godel's incompleteness theorem and forcing (Algorithms in Algebraic Systems and Computation Theory)----------------------------126
@@@@NTT Communication Science Labs., NTT Corporation@@@‰Ν–μ ‘Χl@(Kawano,Yasuhito)
@
19. On Computable Tree Functions (Algorithms in Algebraic Systems and Computation Theory)------------------------------------------138
@@@@ƒRƒ“ƒpƒbƒNƒRƒ“ƒsƒ…[ƒ^(Š”)/‘ΫŠξ“Β‹³‘εŠw@@@–Ψ–{ ³—T/‚‹΄ ³Žq@(Kimoto,Masahiro/Takahashi,Masako)
@
20. Model-robustness of equilibrium in game for modal logics (Algorithms in Algebraic Systems and Computation Theory)--------------151
@@@@ˆοιH‹Ζ‚“™κ–εŠwZŽ©‘R‰ΘŠw‰Θ(”Šw)@@@Ό‹v —²@(Matsuhisa,Takashi)
@
21. Algorithmic Analysis of LS-systems : Solving the 3-SAT problems in a logarithmic space (Algorithms in Algebraic Systems and Computation Theory)---155
@@@@ATRlŠΤξ•ρ‰ΘŠwŒ€‹†Š/ATRlŠΤξ•ρ‰ΘŠwŒ€‹†Š@@@/‰ΊŒ΄ ŸŒ›@(Liu,Jian-Qin/Shimohara,Katsunori)
@
22. On the Regularity of the Power Language of a Regular Language : Extended abstract (Algorithms in Algebraic Systems and Computation Theory)---156
@@@@Department of Computer Science, Eotvos Lorand University@@@Horvath,Sandor
@