کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
390208 661228 2009 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Grammar theory based on lattice-ordered monoid
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
Grammar theory based on lattice-ordered monoid
چکیده انگلیسی

Motivated by Li and Pedrycz's work on fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids and inspired by the close relationship between the automata theory and the theory of formal grammars, we have established a fundamental framework of L-valued grammar. It is shown that the set of L-valued regular languages coincides with the set of L-languages recognized by nondeterministic L-fuzzy finite automata and every L-language recognized by a deterministic L-fuzzy finite automaton is an L-valued regular language.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Fuzzy Sets and Systems - Volume 160, Issue 8, 16 April 2009, Pages 1152-1161