DFA Minimization of Fuzzy Multiset Automata
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
- Apostolos Syropoulos (ORCID: https://orcid.org/0000-0002-9625-1482)
- Binod Kumar Sharma (ORCID: https://orcid.org/0000-0002-0011-5292)
Institutions
- Birla Institute of Technology, Mesra (IN)
Publication Details
- Journal
- Journal of Analytical Uncertainty
- Published
- 2026-11-17
- DOI
- https://doi.org/10.63924/jau.v2i1.363
- Primary Topic
- semigroups and automata theory
- Type
- article
- Field-Weighted Citation Impact
- 0.00