DeepAI AI Chat
Log In Sign Up

MK-fuzzy Automata and MSO Logics

09/07/2017
by   Manfred Droste, et al.
Johannes Kepler University Linz
ARISTOTLE UNIVERSITY OF THESSALONIKI
UNIVERSITÄT LEIPZIG
0

We introduce MK-fuzzy automata over a bimonoid K which is related to the fuzzification of the McCarthy-Kleene logic. Our automata are inspired by, and intend to contribute to, practical applications being in development in a project on runtime network monitoring based on predicate logic. We investigate closure properties of the class of recognizable MK-fuzzy languages accepted by MK-fuzzy automata as well as of deterministically recognizable MK-fuzzy languages accepted by their deterministic counterparts. Moreover, we establish a Nivat-like result for recognizable MK-fuzzy languages. We introduce an MK-fuzzy MSO logic and show the expressive equivalence of a fragment of this logic with MK-fuzzy automata, i.e., a Büchi type theorem.

READ FULL TEXT

page 1

page 2

page 3

page 4

12/10/2010

Nondeterministic fuzzy automata

Fuzzy automata have long been accepted as a generalization of nondetermi...
02/18/2021

On Typical Hesitant Fuzzy Languages and Automata

The idea of nondeterministic typical hesitant fuzzy automata is a genera...
02/04/2020

On Stochastic Automata over Monoids

Stochastic automata over monoids as input sets are studied. The well-def...
02/26/2011

Bisimulations for fuzzy automata

Bisimulations have been widely used in many areas of computer science to...
02/26/2011

Reduction of fuzzy automata by means of fuzzy quasi-orders

In our recent paper we have established close relationships between stat...
04/24/2018

Quantum Büchi Automata

This paper defines a notion of quantum Büchi automaton (QBA for short) w...
12/03/2020

Computing Crisp Simulations and Crisp Directed Simulations for Fuzzy Graph-Based Structures

Like bisimulations, simulations and directed simulations are used for an...