| 作成者 |
|
|
|
| 本文言語 |
|
| 発行日 |
|
| 収録物名 |
|
| 出版タイプ |
|
| アクセス権 |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
This paper studies a fuzzy graph rewriting with single pushout approach from a viewpoint of fuzzy relational calculus. Two possible kinds of matchings for fuzzy graph rewritings are given, namely, a r...igorous matching which just generalizes matchings for crisp (or ordinary) graph rewritings, and an $ \varepsilon $ -matching which represents rather ambiguous or fuzzy one. Finally the pullback structure of fuzzy graphs are analyzed for pullback rewritings.続きを見る
|
Mendeley出力
trcs132-Rewriting_Fuzzy_graph