Complexity of terms, superpositions, and generalized hypersubstitutions
In this paper, we consider the four useful measurements of the complexity of a term, called the maximum depth, the minimum depth, the variable count, and the operation count. We construct a formula for the complexity of the superposition Sm (s, t1, ..., tm) in terms of complexity of the inputs s, t1...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2014
|
| Online Access: | http://www.scopus.com/inward/record.url?eid=2-s2.0-72949120350&partnerID=40&md5=9db24f2fc57e36bc0796e91567ff67d6 http://cmuir.cmu.ac.th/handle/6653943832/6368 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| Language: | English |
| Summary: | In this paper, we consider the four useful measurements of the complexity of a term, called the maximum depth, the minimum depth, the variable count, and the operation count. We construct a formula for the complexity of the superposition Sm (s, t1, ..., tm) in terms of complexity of the inputs s, t1, ..., tm for each of these measurements. We also obtain formulas for the complexity of over(σ, ̂) [t] in terms of the complexity where t is a compound term and σ is a generalized hypersubstitution. We apply these formulas to the theory of M-strongly solid varieties, examining the k-normalization chains of a variety with respect to these complexity measurements. Crown Copyright © 2009. |
|---|