【24h】

Fuzzy Graph Language Recognizability

机译:模糊图语言可识别性

获取原文
获取原文并翻译 | 示例

摘要

Fuzzy graph language recognizability is introduced along the lines of the established theory of syntactic graph language recognizability by virtue of the algebraic structure of magmoids. The main closure properties of the corresponding class are investigated and several interesting examples of fuzzy graph languages are examined.
机译:模糊图语言的可识别性是根据已建立的句法图语言的可识别性理论,根据类磁铁的代数结构而引入的。研究了相应类的主要闭包特性,并研究了一些有趣的模糊图语言示例。

著录项

  • 来源
  • 会议地点 Halkidiki(GR);Halkidiki(GR)
  • 作者单位

    Department of Production Engineering and Management,Laboratory of Computational Mathematics, School of Engineering,Democritus University of Thrace, V. Sofias 12,Prokat, Building Al, 67100Xanthi, Greece;

    Department of Production Engineering and Management,Laboratory of Computational Mathematics, School of Engineering,Democritus University of Thrace, V. Sofias 12,Prokat, Building Al, 67100Xanthi, Greece;

    Department of Forestry Management of the Environment Natural Resources,Democritus University of Thrace, 193 Pandazidou St., 68200, Nea Orestiada, Greece;

  • 会议组织
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 人工智能理论;人工智能理论;
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号