In this paperwe adapt thewell-knownBrzozowskideterminizationmethod to fuzzy automata. Thismethod gives better results than all previously knownmethods for determinization of fuzzy automata developed by Bělohlávek [InformSciences 143 (2002)205–209],Li andPedrycz [FuzzySet Syst 156 (2005)68–92], Ignjatović et al. [Inform Sciences 178 (2008) 164–180], and Jančić et al. [Inform Sciences 181 (2011) ...

Bisimulations have beenwidely used inmany areas of computer science tomodel equivalence between various systems, and to reduce the number of states of these systems, whereas uniform fuzzy relations have recently been introduced as a means to model the fuzzy equivalence between elements of two possible different sets. Here we use the conjunction of these two concepts as a powerful tool in the st...

This work is towards the study of the relationship between fuzzy preordered sets and Alexandrov (left/right) fuzzy topologies based on generalized residuated lattices here the fuzzy sets are equipped with generalized residuated lattice in which the commutative property doesn't hold. Further, the obtained results are used in the study of fuzzy automata theory.

Automata theory plays a key role in computational theory as many computational problems can be solved with its help. Formal grammar is a special type of automata designed for linguistic purposes. Formal grammar generates formal languages. Rough grammar and rough languages were introduced to incorporate the imprecision of real languages in formal languages. These languages have limitations on un...

The aim of this paper is the study of a covering of a max-mingeneral fuzzy automaton by another, admissible relations, admissiblepartitions of a max-min general fuzzy automaton,$tilde{delta}$-orthogonality of admissible partitions, irreduciblemax-min general fuzzy automata. Then we obtain the relationshipsbetween them.  

Automata are the prime example of general computational systems over discrete spaces. The incorporation of fuzzy logic into automata theory resulted in fuzzy auotomata which can handle continuous spaces. Moreover, they are able to model uncertainty which is inherent in many applications. Deterministic Finite-state Automata (DFA) have been the architecture, most used in many applications, but, t...

Simulations and bisimulations between two fuzzy automata over a complete residuated lattice were defined by Ćirić et al. (2012) [7], [8] as relations the sets of states automata. However, they act crisp relationship In particular, if there exists (forward) bisimulation automata, then languages recognized them are crisply equal. Approximate simulations introduced Stanimirović (2022) [36] aim at ...

Classical automata theory cannot deal with the system uncertainty. To deal with the system uncertainty the concept of fuzzy finite automata was proposed. Fuzzy automata can be used in diverse applications such as fault detection, pattern matching, measuring the fuzziness between strings, description of natural languages, neural network, lexical analysis, image processing, scheduling problem and...