Art

J-GLOBAL ID：200902133903029147   Reference number：93A0273306

On the Confluent Property of Right-Ground Term Rewriting Systems.

右定項-項書換えシステムの合流性について

Author (2)： OYAMAGUCHI MICHIO (三重大 工) ,  OTA YOSHIKATSU (三重大 工)
Material： 電子情報通信学会論文誌 D-1  (IEICE Transactions on Information and Systems, Pt.1 (Japanese Edition))
Volume： 76  Issue： 2  Page： 39-45  Publication year： Feb. 1993 
JST Material Number： S0757B  ISSN： 0915-1915  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： JAPANESE (JA)

Thesaurus term： rewriting rule ,...

   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=93A0273306&from=J-GLOBAL&jstjournalNo=S0757B") }}

JST classification (1)： Theory of computation  (JB02000A)

Reference (12)：

• DAUCHET, M. Decidability of the Confluence of Finite Ground Term Rewrite Systems and of Other Related Term Rewrite Systems. Inform. Comput. 1990, 88, 187-201
• DERSHOWITZ, N. Rewrite Systems. Handbook of Theoretical Computer Science. 1990, B, 243-320
• HUET, G. Confluent reductions : abstract properties and applications to term rewriting systems. J. ACM. 1980, 27, 797-821
• HUET, G. Equations and Rewrite Rules ; A Survey. Formal Language Theory : Perspectives and Open Problems. 1980, 349-393
• KNUTH, D. Simple word problems in universal algebra. Computational Problems in Abstract Algebra. 1970, 263-297

Terms in the title (2)： 項書換えシステム ,  合流性