Fuzzy Tree Automata and Syntactic Pattern Recognition

Abstract

An approach of representing patterns by trees and processing these trees by fuzzy tree automata is described. Fuzzy tree automata are defined and investigated. The results include that the class of fuzzy root-to-frontier recognizable ¿-trees is closed under intersection, union, and complementation. Thus, the class of fuzzy root-to-frontier recognizable… (More)
DOI: 10.1109/TPAMI.1982.4767279

Topics

2 Figures and Tables

Slides referencing similar topics