1 paper
Rupsa Saha, Ole-Christoffer Granmo, Vladimir I. Zadorozhny +1
TMs are a pattern recognition approach that uses finite state machines for learning and propositional logic to represent patterns. In addition to being natively interpretable, they…