On fuzzy multiset automata

Tiwari, S. P.; Gautam, Vinay; Dubey, M. K.

doi:10.1007/s12190-015-0924-4

Cited by 17 publications

(11 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The concepts related to multisets, we use in this paper are fairly standard and can be found in the literature (cf., [4,6,32,33]). We begin with the following.…”

Section: Preliminariesmentioning

confidence: 99%

“…In this section, we recall the concepts and properties of fuzzy multiset finite automaton and fuzzy multiset regular language from [32,33]. Thereafter, we introduce λ -cut of a fuzzy multiset language and show that λ -cut of a given fuzzy multiset regular language is a multiset regular language.…”

Section: Fuzzy Multiset Regular Languagesmentioning

confidence: 99%

“…In [33], it is shown that if a fuzzy multiset language is generated by a fuzzy multiset regular grammar, it can be accepted by a fuzzy multiset finite automaton, and vice-versa. Recently, Tiwari, Gautam and Dubey [32] shown that a deterministic fuzzy multiset finite automaton is equally powerful as a fuzzy multiset finite automaton in the sense of acceptance of a fuzzy multiset language. Also, in [32], the minimal realizations (minimal deterministic fuzzy multiset automata) for a given fuzzy muliset language is studied.…”

Section: Introductionmentioning

confidence: 99%

“…Recently, Tiwari, Gautam and Dubey [32] shown that a deterministic fuzzy multiset finite automaton is equally powerful as a fuzzy multiset finite automaton in the sense of acceptance of a fuzzy multiset language. Also, in [32], the minimal realizations (minimal deterministic fuzzy multiset automata) for a given fuzzy muliset language is studied. But, there is a silence on equivalence of multiset regular languages and fuzzy multiset regular languages.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

On fuzzy multiset regular languages

Sharma¹,

Gautam²,

Tiwari³

et al. 2017

Journal of Fuzzy Set Valued Analysis

Self Cite

View full text Add to dashboard Cite

The purpose of present work is to study some algebraic aspect of fuzzy multiset regular languages. In between, we show the equivalence of multiset regular language and fuzzy multiset regular language. Finally, we introduce the concept of pumping lemma for fuzzy multiset regular languages, which we use to establish a necessary and sufficient condition for a fuzzy multiset language to be non-constant.

show abstract

“…The concepts related to multisets, we use in this paper are fairly standard and can be found in the literature (cf., [4,6,32,33]). We begin with the following.…”

Section: Preliminariesmentioning

confidence: 99%

Section: Fuzzy Multiset Regular Languagesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

On fuzzy multiset regular languages

Sharma¹,

Gautam²,

Tiwari³

et al. 2017

Journal of Fuzzy Set Valued Analysis

Self Cite

View full text Add to dashboard Cite

show abstract

“…Besides, they defined some closure properties of fuzzy multiset finite languages family under certain regular operations [60]. Shortly thereafter, in 2015, Tiwari, Gautam and Dubey widened the study done by Wang and his friends by associating a deterministic fuzzy multiset finite automaton with a given fuzzy multiset finite automaton and showing that both automata are equally powerful in the sense of fuzzy multiset language acceptance in [61]. They as well studied and presented two minimal realizations of fuzzy multiset language where they proved that both of them are isomorphic [61].…”

Section: Proposition 3 [58]mentioning

confidence: 99%

Structurally and Arithmetically Controlled Grammars

Ashaari¹,

Turaev²,

Okhunov³

2016

IJPCC

View full text Add to dashboard Cite

Over the quarter century, it is gratifying to note that the significance of regulated or controlledgrammars (i.e. grammars with regulated rewriting) has been recognized by many parties where it has beenused widely in a great variety of scientific disciplines ranging from Linguistics through DNA Computing upto the Informatics and recently come to Big Data Analytics. Therefore, literally we can find hundreds ofstudies of well-known of various types of controlled grammars and their investigation have amount to athrilling trend within formal language theory. Given the extensive literature on issues related to controlledgrammars, this research focused on arithmetically controlled grammars and tree controlled grammars,which are practically important. Thereby, in this paper, we briefly recapitulate the background of formallanguage theory and highlight the key results of multiset grammars, valence grammars and tree controlledgrammars. In this paper, a new controlled grammar that can be generated using both control mechanismstogether is proposed for future research.

show abstract