Bibliographic Details
| Title: |
Fuzzy graphs: algebraic structure and syntactic recognition. |
| Authors: |
Kalampakas, Antonios1 akalampakas@gmail.com, Spartalis, Stefanos1 sspart@pme.duth.gr, Iliadis, Lazaros2 liliadis@fmenr.duth.gr, Pimenidis, Elias3 e.pimenidis@uel.ac.uk |
| Source: |
Artificial Intelligence Review. Oct2014, Vol. 42 Issue 3, p479-490. 12p. |
| Subjects: |
Fuzzy hypergraphs, Fuzzy graphs, Ordered algebraic structures, Semantics (Philosophy), Hypergraphs |
| Abstract: |
Directed fuzzy hypergraphs are introduced as a generalization of both crisp directed hypergraphs and directed fuzzy graphs. It is proved that the set of all directed fuzzy hypergraphs can be structured into a magmoid with operations graph composition and disjoint union. In this framework a notion of syntactic recognition inside magmoids is defined. The corresponding class is proved to be closed under boolean operations and inverse morphisms of magmoids. Moreover, the language of all strongly connected fuzzy graphs and the language that consists of all fuzzy graphs that have at least one directed path from the begin node to the end node through edges with membership grade 1 are recognizable. Additionally, a useful characterization of recognizability through left derivatives is also achieved. [ABSTRACT FROM AUTHOR] |
|
Copyright of Artificial Intelligence Review is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
