Transformations of fuzzy graphs specified by FD-grammars
From MaRDI portal
Publication:2458054
DOI10.1007/s10559-007-0046-6zbMath1125.68065OpenAlexW1984640803MaRDI QIDQ2458054
I. N. Parasyuk, Sergey V. Ershov
Publication date: 31 October 2007
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-007-0046-6
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)
Related Items
Category-theoretic formalization in designing fuzzy intelligent systems, Graph rewriting and relabeling with PBPO\(^+\): a unifying theory for quasitoposes, Uncertain linear systems of equations: strong solvability and strong feasibility, Systems of linear equations with fuzzy set data: weak solvability and weak admissibility, Transformational approach to the development of software architectures on the basis of fuzzy graph models
Cites Work
