Head Boundedness of Nonterminating Rewritings  

作　　者：陈意云 

出　　处：《Journal of Computer Science & Technology》1995年第3期281-284,共4页计算机科学技术学报（英文版）

摘　　要：Further research about nonterminating rewritings is introduced. First, the previousdefinition of head boundedness is modified to exclude nonfair reduction sequences.A sufficient condition is then given to determine head boundedness of term rewritingsystems. The condition is then developed to a method to determine head boundednessof constructor systems.Further research about nonterminating rewritings is introduced. First, the previousdefinition of head boundedness is modified to exclude nonfair reduction sequences.A sufficient condition is then given to determine head boundedness of term rewritingsystems. The condition is then developed to a method to determine head boundednessof constructor systems.

关 键 词：Term rewriting system constructor system head boundedness 

分 类 号：TP301.5[自动化与计算机技术—计算机系统结构]