CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Fuzzy graphs: Algebraic structure and syntactic recognition
Authors
Lazaros Iliadis
Antonios Kalampakas
Elias Pimenidis
Stefanos Spartalis
Publication date
1 October 2014
Publisher
'Springer Science and Business Media LLC'
Doi
Cite
Abstract
© Springer Science+Business Media Dordrecht 2013. 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 mor-phisms 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
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
UWE Bristol Research Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:uwe-repository.worktribe.c...
Last time updated on 08/06/2020