Fuzzy graphs: Algebraic structure and syntactic recognition
- Submitting institution
-
University of the West of England, Bristol
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 810878
- Type
- D - Journal article
- DOI
-
10.1007/s10462-013-9412-0
- Title of journal
- Artificial Intelligence Review
- Article number
- -
- First page
- 479
- Volume
- 42
- Issue
- 3
- ISSN
- 0269-2821
- Open access status
- Out of scope for open access requirements
- Month of publication
- October
- Year of publication
- 2014
- URL
-
http://dx.doi.org/10.1007/s10462-013-9412-0
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
-
- Citation count
- 1
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The work uses a notion of algebraic recognisability for sets of directed (hyper)graphs with fuzzy edges and fuzzy nodes, in analogy with the corresponding recognisability notions for strings and trees.
It does so by employing the syntactic magmoid in a role analogous to the syntactic monoid of string languages. This allows the exploration of the fuzzy case for existing crisp graph theoretic methods and techniques involving formal verification, natural language processing, and syntactic complexity, as well as the recognition of established fuzzy notions such as handwritten writing and fuzzy cognitive maps; with potential contribution to security and digital forensics.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
