Fuzzy Graph Language Recognizability
Abstract
Fuzzy graph language recognizability is introduced along the lines of the established theory of syntactic graph language recognizability by virtue of the algebraic structure of magmoids. The main closure properties of the corresponding class are investigated and several interesting examples of fuzzy graph languages are examined.
Domains
Computer Science [cs]Origin | Files produced by the author(s) |
---|
Loading...