首页> 外文期刊>Fuzzy sets and systems >A generalization of Myhill-Nerode theorem for fuzzy languages
【24h】

A generalization of Myhill-Nerode theorem for fuzzy languages

机译:模糊语言的Myhill-Nerode定理的推广

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

摘要

The well-known Myhill-Nerode Theorem provides a necessary and sufficient condition for a language to be regular. In the context of fuzzy languages and automata theory, Myhill-Nerode type theorems have been proved for fuzzy languages with finite range. This paper introduces a new right equivalence relation on the free monoid of an alphabet based on the notion of factorization of fuzzy languages. The index of this relation for a fuzzy language with infinite range can be finite. This fact allows us to generalize the Myhill-Nerode Theorem for any kind of fuzzy languages. In this paper is proved that the following two conditions are mutually equivalent for a given fuzzy language X: (i) there exists a factorization such that the right equivalence relation of X( defined via the factorization) has a finite index; (ii) the fuzzy language Xis recognized by a fuzzy deterministic finite automaton. (C) 2015 Elsevier B.V. All rights reserved.
机译:众所周知的Myhill-Nerode定理提供了使语言规则的必要和充分条件。在模糊语言和自动机理论的背景下,已经证明了有限范围的模糊语言的Myhill-Nerode型定理。本文基于模糊语言的因式分解概念,介绍了一种关于字母的自由半身像的新权利对等关系。对于具有无限范围的模糊语言,此关系的索引可以是有限的。这一事实使我们能够将Myhill-Nerode定理推广为任何一种模糊语言。本文证明对于给定的模糊语言X,以下两个条件是相互等价的:(i)存在因式分解,使得X(通过因式分解定义)的右等价关系具有有限索引; (ii)由模糊确定性有限自动机识别的模糊语言Xis。 (C)2015 Elsevier B.V.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号