Distinguishability and completeness of crisp deterministic fuzzy automata

DOI10.22111/IJFS.2017.3430zbMATH Open1398.68330OpenAlexW2739460867MaRDI QIDQ4553373FDOQ4553373

Authors: Renu Verma, S. P. Tiwari 

Publication date: 2 November 2018

Full work available at URL: https://ijfs.usb.ac.ir/article_3430.html

Recommendations

• Determinism and fuzzy automata
• scientific article; zbMATH DE number 2058606
• On distinguishability of states of automata
• The universal fuzzy automaton
• On fuzzy multiset automata

zbMATH Keywords

homomorphismindistinguishable statescrisp deterministic fuzzy automatoninput-indistinguishableoutput complete

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Nondeterministic fuzzy automata
• Determinization of fuzzy automata with membership values in complete residuated lattices
• The universal fuzzy automaton
• Title not available (Why is that?)
• Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
• Automata theory based on complete residuated lattice-valued logic
• Automata theory based on complete residuated lattice-valued logic. II
• Myhill-Nerode type theory for fuzzy languages and automata
• Intuitionistic fuzzy finite state machines
• Quotient structures of intuitionistic fuzzy finite state machines
• Intuitionistic fuzzy finite switchboard state machines
• Algebraic structures of automata
• Structure and Transition-Preserving Functions of Finite Automata
• Products of \(T\)-generalized state machines and \(T\)-generalized transformation semigroups
• The equivalence between fuzzy Mealy and fuzzy Moore machines
• Computing behavior of finite fuzzy machines -- algorithm and its application to reduction and minimization
• Title not available (Why is that?)
• A topology for automata: A note
• New directions in fuzzy automata
• Grammar theory based on lattice-ordered monoid
• General formulation of sequential machines
• A topology for automata. II
• Some Remarks on Abstract Machines
• On proper fuzzification of finite state machine
• Fuzzy automata based on lattice-ordered monoid with algebraic and topological aspects
• Algebraic properties of \(L\)-fuzzy finite automata
• Bifuzzy core of fuzzy automata
• On minimal realization of fuzzy behaviour and associated categories
• Fuzzy subsystems of fuzzy automata based on lattice-ordered monoid

Cited In (2)

• Criteria for the completeness of algorithms for fuzzy marking
• Lattice structures of automata

This page was built for publication: Distinguishability and completeness of crisp deterministic fuzzy automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4553373)