Syntactic recognizability of graphs with fuzzy attributes
From MaRDI portal
Publication:2445984
DOI10.1016/j.fss.2013.04.015zbMath1284.68537OpenAlexW1990369857MaRDI QIDQ2445984
Antonios Kalampakas, Lazaros Iliadis, Stefanos Spartalis
Publication date: 15 April 2014
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.fss.2013.04.015
Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37) Fractional graph theory, fuzzy graph theory (05C72)
Cites Work
- An axiomatization of graphs
- On the recognizability of fuzzy languages. II
- On the recognizability of fuzzy languages. I
- Fuzzy cognitive maps. Advances in theory, methodologies, tools and applications
- Context-free graph grammars and concatenation of graphs
- Fuzzy graphs and fuzzy hypergraphs
- Minimization of fuzzy finite automata
- Fuzzy tree language recognizability
- Fuzzy tree automata
- Infinite fuzzy computations
- Graph automata
- Recognizability of graph and pattern languages
- Fuzzy regular languages over finite and infinite words
- The recognizability of sets of graphs is a robust property
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Graph Automata: The Algebraic Properties of Abelian Relational Graphoids
- A Logic on Subobjects and Recognizability
- The Syntactic Complexity of Eulerian Graphs
- Fuzzy cognitive maps
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Syntactic recognizability of graphs with fuzzy attributes