Zur Hauptnavigation wechseln Zur Suche wechseln Zum Hauptinhalt wechseln

MK-fuzzy Automata and MSO Logics

Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

Abstract

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¨uchi type theorem.
OriginalspracheEnglisch
Titel8th Symposium on Games, Automata, Logics and Formal Verification (GandALF'17)
Herausgeber*innen P. Bouyer, A. Orlandini, P. San Pietro
Seiten106-120
Seitenumfang15
Band256
DOIs
PublikationsstatusVeröffentlicht - 06 Sep. 2017

Publikationsreihe

NameElectronic Proceedings in Theoretical Computer Science (EPTCS)
ISSN (Print)2075-2180

Wissenschaftszweige

  • 101 Mathematik
  • 101001 Algebra
  • 101005 Computeralgebra
  • 101009 Geometrie
  • 101012 Kombinatorik
  • 101013 Mathematische Logik
  • 101020 Technische Mathematik

JKU-Schwerpunkte

  • Computation in Informatics and Mathematics

Dieses zitieren