Complexity of terms, superpositions, and generalized hypersubstitutions
From MaRDI portal
Publication:980303
DOI10.1016/j.camwa.2009.06.033zbMath1189.08002OpenAlexW2068627862MaRDI QIDQ980303
Wattapong Puninagool, Sorasak Leeratanavalee
Publication date: 28 June 2010
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2009.06.033
superposition\(k\)-normalization chains\(M\)-strongly solid varietygeneralized hypersubstitutionthe maximum depththe minimum depththe operation countthe variable count
Related Items (4)
Unnamed Item ⋮ Superassociative structures of terms and formulas defined by transformations preserving a partition ⋮ CIRCUIT INTEGRATION THROUGH LATTICE HYPERTERMS ⋮ Unnamed Item
Cites Work
This page was built for publication: Complexity of terms, superpositions, and generalized hypersubstitutions