We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Chen Yiyun. Head Boundedness of Nonterminating Rewritings[J]. Journal of Computer Science and Technology, 1995, 10(3): 281-284.
Citation: Chen Yiyun. Head Boundedness of Nonterminating Rewritings[J]. Journal of Computer Science and Technology, 1995, 10(3): 281-284.

Head Boundedness of Nonterminating Rewritings

More Information
  • Published Date: May 09, 1995
  • 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.
  • [1]
    Nachum Dershowitz, Stephane Kaplan. Rewrite, rewrite, rewrite, rewrite, rewrite.…In 16th Annual Symposium on Principles of Programming Languages, SIGPLAN and SIGACT, pp. 250-259, 1989.
    [2]
    Nachum Dershowitz, Stephane Kaplan, David A. Plaisted. Infinite normal forms. Lecture Notes in Computer Science, Springer-Verlag, Vol.372, pp. 249-262, 1989.
    [3]
    Nachum Dershowitz, Stephane Kaplan, David A. Plaisted. Rewrite, rewrite, rewrite, rewrite, rewrite.…Theretical Computer Sciencce, 1991, 83(1), 71-96. ……….
  • Related Articles

    [1]Su Feng. Mechanizing Weakly Ground Termination Proving of Term Rewriting Systemsby Structural and Cover-Set Inductions[J]. Journal of Computer Science and Technology, 2005, 20(4): 496-513.
    [2]LIN Chuang, XU MingWei. Stability Analysis of Buffer Priority Scheduling Policies Using Petri Nets[J]. Journal of Computer Science and Technology, 2003, 18(3).
    [3]LIU Qingshan, MA Songde, LU Hanqing. Head Tracking Using Shapes and Adaptive Color Histograms[J]. Journal of Computer Science and Technology, 2002, 17(6).
    [4]JIAO Li, LU Weiming. Notes on Liveness and Boundedness of Extended Strong Asymmetric Choice Nets Ⅱ[J]. Journal of Computer Science and Technology, 2001, 16(5).
    [5]SUN Yongqiang, LIN Kai, LU Chaojun. Partial Completion of Equational Theories[J]. Journal of Computer Science and Technology, 2000, 15(6): 552-559.
    [6]SUN Yongqiang, LIN Kai, LU Chaojun. Partial Completion of Equational Theories[J]. Journal of Computer Science and Technology, 2000, 15(6).
    [7]WANG Xiaodong, XU Ming, ZHOU Xingming. Fast Multicast on Multistage Interconnection Networks Using Multi-Head Worms[J]. Journal of Computer Science and Technology, 1999, 14(3): 250-258.
    [8]Wang Huaimin, Chen Huowang. A Constructor-Based EI-Model Semantics of EI-CTRS[J]. Journal of Computer Science and Technology, 1995, 10(1): 85-96.
    [9]Chen Yiyun. Nonterminating Rewritings with Head Boundedness[J]. Journal of Computer Science and Technology, 1993, 8(2): 66-75.
    [10]Zhang Xubo. Some Results on the Confluence Property of Combined Term Rewriting Systems[J]. Journal of Computer Science and Technology, 1991, 6(3): 291-295.

Catalog

    Article views (17) PDF downloads (1496) Cited by()
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return