Co-operative Research on Discrete Computer Mathematics

Iri等人利用计算图和拓扑结构原理开发了几何问题的快速自动微分方法。Enomoto肯定地解决了Artin半群中的词问题，得到了Nash-Williams公式的另一个简单证明。Huzino，Kawahara等人通过大规模信息学实验展示了有限元胞自动机的许多特性。Nakajima等人研究了方便计算机环境的多媒体系统建模和实现的基础。西泽对自动机理论和归纳推理理论进行了研究。Shinohara，Arikawa等人发展了自动机理论，计算复杂性理论，类比理论，模型学习和机器学习。Hirose，Kakei等人利用假名和汉字的转换对日语文档和语义分析进行了一系列研究。Igarashi等人在Presburger算法中证明了所有具有r…更多国家系数的线性项的可决性。Sato等人研究了符号表达式的抽象机制，并将其应用于lambda术语。Namba一直在继续他对雅可比多项式和有限域上的电曲线的研究，分析它们的数学结构。Oshiba自然地在理论中引入了自动定理证明。Uesu研究了片段公理化的一般方法。Ono等人获得了许多关于无结构规则逻辑的决策问题和有限模型性质的结果。Kobayashi证明了SIGMA^0 -完全规划的Martin-Lof随机性和恶性分布的严格存在性。Hourai等人用平行约简给出了一个简单的证明，证明了微积分的Church-Rosser性质。Kasai等人已经解决了许多关于并行算法和复杂度的问题。Miyano等人研究了许多并行算法及其在氨基酸序列机器发现中的应用。少

Iri et al. has developed the methodology of fast automatic differentiations for geometric problems using computation graphs and topological structure principle. Enomoto has affirmatively solved the word problem in Artin semigroups, obtained another simple proof of Nash-Williams formulae. Huzino,Kawahara et al. have showed many properties of finite cellular automata by large-scale informatic experiments Nakajima et al. studied fundations on modelling and implementation of multi-media systems for convenient computer environments. Nishizawa have studied on automata theory and theory of inductive inference. Shinohara,Arikawa et al. have developed automata theory, theory of computational complex- ity, theory of analogy, model learnings and machine learnings. Hirose,Kakei et al. have performed a series of researches on Japanese documents and semantics analysis applying the transformation between Kana and Kanji sentences. Igarashi et al. have proved the decidability of all linear terms with r … More ational co-efficients in Presburger Arithmetic. Sato et al. have studied abstraction mechanisms of symbolic expressions and applied it to lambda-terms. Namba has been continuing his studies on Jacobi polynomials and ellectic curves on finite fields to analyze their mathematical structures. Oshiba has naturally introduced in the theory of automatic theorem proving. Uesu has investigated a general method of axiomatizing fragments. Ono et al. have obtained many results of decision problems and finite model properties for logics without structure rules. Kobayashi has proved Martin-Lof ramdomness of SIGMA^0_-complete programs and astrict existence of malign distributions. Hourai et al. have presented a simple proof of the Church-Rosser property of rambda-calculus using parallel reductions. Kasai et al. have solved many questions on parallel algothsims and complexity.Miyano et al. investigated a lot of parallel algorithms and their applications to a machine discovery from amino acid sequences. Less