DISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA
From MaRDI portal
Publication:4553373
DOI10.22111/ijfs.2017.3430zbMath1398.68330OpenAlexW2739460867MaRDI QIDQ4553373
Publication date: 2 November 2018
Full work available at URL: https://ijfs.usb.ac.ir/article_3430.html
homomorphismindistinguishable statescrisp deterministic fuzzy automatoninput-indistinguishableoutput complete
Related Items
Cites Work
- The universal fuzzy automaton
- Algebraic structures of automata
- Nondeterministic fuzzy automata
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- Intuitionistic fuzzy finite switchboard state machines
- The equivalence between fuzzy Mealy and fuzzy Moore machines
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic. II
- Computing behavior of finite fuzzy machines -- algorithm and its application to reduction and minimization
- Myhill-Nerode type theory for fuzzy languages and automata
- Grammar theory based on lattice-ordered monoid
- A topology for automata. II
- Products of \(T\)-generalized state machines and \(T\)-generalized transformation semigroups
- Intuitionistic fuzzy finite state machines
- New directions in fuzzy automata
- Fuzzy automata based on lattice-ordered monoid with algebraic and topological aspects
- Algebraic properties of \(L\)-fuzzy finite automata
- Quotient structures of intuitionistic fuzzy finite state machines
- Determinization of fuzzy automata with membership values in complete residuated lattices
- On minimal realization of fuzzy behaviour and associated categories
- Some Remarks on Abstract Machines
- A topology for automata: A note
- General formulation of sequential machines
- Structure and Transition-Preserving Functions of Finite Automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
