2000 character limit reached
On Typical Hesitant Fuzzy Languages and Automata
Published 18 Feb 2021 in cs.FL and cs.CL | (2102.09347v1)
Abstract: The idea of nondeterministic typical hesitant fuzzy automata is a generalization of the fuzzy automata presented by Costa and Bedregal. This paper, presents the sufficient and necessary conditions for a typical hesitant fuzzy language to be computed by nondeterministic typical hesitant fuzzy automata. Besides, the paper introduces a new class of Typical Hesitant Fuzzy Automata with crisp transitions, and we will show that this new class is equivalent to the original class introduced by Costa and Bedregal
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.