On Typical Hesitant Fuzzy Languages and Automata
| Autor: | Costa, Valdigleis S., Bedregal, Benjamín C., Santiago, Regivan H. N. |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
FOS: Computer and information sciences
Computer Science - Computation and Language ComputingMethodologies_PATTERNRECOGNITION TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES Mathematics::General Mathematics Formal Languages and Automata Theory (cs.FL) Computer Science - Formal Languages and Automata Theory Nonlinear Sciences::Cellular Automata and Lattice Gases Computation and Language (cs.CL) Physics::History of Physics Computer Science::Formal Languages and Automata Theory |
| DOI: | 10.48550/arxiv.2102.09347 |
| Popis: | 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 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|