Intuitionistic fuzzy \(( \otimes,N)\)-general regular languages and their minimization implementation
From MaRDI portal
Publication:2077025
DOI10.1016/j.ijar.2022.01.013OpenAlexW4210311685MaRDI QIDQ2077025
Publication date: 22 February 2022
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2022.01.013
generalized operationintuitionistic fuzzy \((\otimesintuitionistic fuzzy automatonminimization implementationN)\)-general regular language
Cites Work
- Unnamed Item
- Nondeterministic fuzzy automata with membership values in complete residuated lattices
- Nondeterministic fuzzy automata
- Intuitionistic fuzzy recognizers and intuitionistic fuzzy finite automata
- IF-topologies and IF-automata
- Intuitionistic fuzzy sets
- Triangular norms
- On cuts of Atanassov's intuitionistic fuzzy sets with respect to fuzzy connectives
- Intuitionistic fuzzy finite state machines
- On bipolar fuzzy soft topology with decision-making
- Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders
- Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures
- Approximation and robustness of fuzzy finite automata
- Intuitionistic general fuzzy automata
- Quotient structures of intuitionistic fuzzy finite state machines
- Cuts of intuitionistic fuzzy sets respecting fuzzy connectives
- Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness
- Fuzzy sets
- Automata theory and its applications
- An application of intuitionistic fuzzy sets in medical diagnosis
- Fuzzy \(\epsilon\)-approximate regular languages and minimal deterministic fuzzy automata \(\epsilon\)-accepting them
This page was built for publication: Intuitionistic fuzzy \(( \otimes,N)\)-general regular languages and their minimization implementation
