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: | Wattapong Puninagool, Sorasak Leeratanavalee |
---|---|
格式: | 雜誌 |
出版: |
2018
|
主題: | |
在線閱讀: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=72949120350&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/50734 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Chiang Mai University |
相似書籍
-
Complexity of terms, superpositions, and generalized hypersubstitutions
由: Puninagool W., et al.
出版: (2014) -
The order of generalized hypersubstitutions of type τ = (2)
由: Wattapong Puninagool, et al.
出版: (2018) -
Generalized hypersubstitutions of many-sorted algebras
由: Dawan Chumpungam, et al.
出版: (2020) -
Factorisable monoid of generalized hypersubstitutions of type Γ = (2)
由: Ampika Boonmee, et al.
出版: (2018) -
All intra-regular generalized hypersubstitutions of type (2)
由: Ampika Boonmee, et al.
出版: (2019)