Results 231 to 240 of about 38,430 (279)
Some of the next articles are maybe not open access.
Information Sciences, 1975
Abstract An L -fuzzy grammar is defined by assigning the element of lattice to the rewriting rules of a formal grammar. According to the kind of lattice, say, distributive lattice, lattice-ordered group, and lattice-ordered monoid, two type of L -fuzzy grammars are defined.
Kim, Hyo Heng +3 more
openaire +1 more source
Abstract An L -fuzzy grammar is defined by assigning the element of lattice to the rewriting rules of a formal grammar. According to the kind of lattice, say, distributive lattice, lattice-ordered group, and lattice-ordered monoid, two type of L -fuzzy grammars are defined.
Kim, Hyo Heng +3 more
openaire +1 more source
International Journal of Fuzzy Mathematical Archive, 2017
Inspired by, Conjunctive Grammar (CG) in crisp case, we study the simplication of Fuzzy Conjunctive Grammars (FCG).
null R.Pathrakumar, null M.Rajasekar
openaire +1 more source
Inspired by, Conjunctive Grammar (CG) in crisp case, we study the simplication of Fuzzy Conjunctive Grammars (FCG).
null R.Pathrakumar, null M.Rajasekar
openaire +1 more source
Information Sciences, 1973
A new form of fuzzy grammar, which is called an n-fold fuzzy grammar, is defined and some of its properties are investigated. The n-fold fuzzy grammars are a generalization of fuzzy grammars defined by Lee and Zadeh, where the grade of application of the rule to be used next is conditioned by the n(⩾1) rules used before in a derivation.
Mizumoto, Masaharu +2 more
openaire +2 more sources
A new form of fuzzy grammar, which is called an n-fold fuzzy grammar, is defined and some of its properties are investigated. The n-fold fuzzy grammars are a generalization of fuzzy grammars defined by Lee and Zadeh, where the grade of application of the rule to be used next is conditioned by the n(⩾1) rules used before in a derivation.
Mizumoto, Masaharu +2 more
openaire +2 more sources
Rough Fuzzy Automata and Rough Fuzzy Grammar
International Journal of Fuzzy System Applications, 2017Automata theory plays a key role in computational theory as many computational problems can be solved with its help. Formal grammar is a special type of automata designed for linguistic purposes. Formal grammar generates formal languages. Rough grammar and rough languages were introduced to incorporate the imprecision of real languages in formal ...
Kanchan Tyagi, Alka Tripathi
openaire +1 more source
Fuzzy state grammar and fuzzy deep pushdown automaton
Journal of Intelligent & Fuzzy Systems, 2016Motivated by the concept of fuzzy finite automata and fuzzy pushdown automata, we investigate a novel fuzzy state grammars and fuzzy deep pushdown automata concept. This concept represents a natural extension of contemporary state grammar and deep pushdown automaton, making them more robust in terms of imprecision, errors, and uncertainty.
Kalra, Nidhi, Kumar, Ajay
openaire +1 more source
Quantum Reversible Fuzzy Grammars
2019Reversible languages are a class of regular languages that stands at the junction of several domains. While quantum reversible regular grammars are a special class of fuzzy regular grammars, the algebraic characterizations of quantum reversible regular languages have not been studied so far.
Jianhua Jin, Chunquan Li
openaire +1 more source
Fuzzy Grammar Induction from Large Corpora
2006 IEEE International Conference on Fuzzy Systems, 2006We present a novel algorithm for parsing natural language texts using fuzzy context free grammars (FCFGs). We further provide an algorithm for inferring such a FCFG based on a large corpus of tagged English text. We measure the degree to which novel sentences can be successfully parsed by our system.
P. Carter, S.C. Kremer
openaire +1 more source
Fuzzy Tree Grammar and Fuzzy Forest Grammar
1983In 1956, Chomsky put forward a kind of mathematical model about grammar to approximately describe natural languages. Thus, formal language became one of the important research fields of computer science.
openaire +1 more source
Fuzzy grammar theory based on lattices
Soft Computing, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jin, Jianhua, Li, Qingguo
openaire +1 more source
Fuzzy grammars and recursively enumerable fuzzy languages
Information Sciences, 1992A fuzzy language ( \(L\)-language) is treated as an \(L\)-subset of \(A^*\) with \(A^*\) being a free monoid of an alphabet defined over a finite set \(A\). The main result of the paper states that if \(L\) is finite then an \(L\)-language is generated by an \(L\)-grammar if and only if it is a recursively enumerable \(L\)-subset.
openaire +2 more sources