DFA Minimization of Fuzzy Multiset Automata
Year: 2026
Type: article
Abstract: Deterministic finite automaton (DFA) minimization is the process of converting a DFA into an equivalent DFA with a minimum number of states. Here we apply on such process (i.e., Brzozowski’s algorithm) to crisp deterministic fuzzy multiset finite automata. We introduce reverse fuzzy multiset finite automata and establish a relation between their right and left fuzzy multiset languages. In between, we correlate two crisp-deterministic fuzzy multiset finite automata and show that the reachability and observability map of the given crisp deterministic fuzzy multiset finite automata to be isomorphic.
Authors: Binod Kumar Sharma, Apostolos Syropoulos
Institution: Birla Institute of Technology, Mesra
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: isomorphism, fuzzy automata
Open Access status: hybrid
OpenAlex ID: W7234991227
