The complexity of normal form rewrite sequences for Associativity

Details The complexity of normal form rewrite sequences for Associativity The complexity of normal form rewrite sequences for Associativity

1994-06-20

arxiv.org/abs/cmp-lg/9406030v2

Computer Science

Computation and Language

5 pages

Scientific paper

The complexity of a particular term-rewrite system is considered: the rule of associativity (x*y)*z --> x*(y*z). Algorithms and exact calculations are given for the longest and shortest sequences of applications of --> that result in normal form (NF). The shortest NF sequence for a term x is always n-drm(x), where n is the number of occurrences of * in x and drm(x) is the depth of the rightmost leaf of x. The longest NF sequence for any term is of length n(n-1)/2.

Affiliated with

Also associated with

No associations

Rating

The complexity of normal form rewrite sequences for Associativity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The complexity of normal form rewrite sequences for Associativity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The complexity of normal form rewrite sequences for Associativity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-303673