We introduce MK-fuzzy automata over a bimonoid K which is related to the fuzzification of the McCarthy-Kleene logic. Our automata inspired by, and intend to contribute to, practical applications being in development in the LogicGuard project. We investigate closure properties of the class of MK-fuzzy languages accepted by MK-fuzzy automata as well as by their deterministic counterparts.
Sprache der Kurzfassung:
Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Linz, Austria