MK-fuzzy Automata and MSO Logics

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.

[1]  C. C. Elgot.  Decision problems of finite automata design and related arithmetics , 1961 .

[2]  J. Mordeson,et al.  Fuzzy Automata and Languages: Theory and Applications , 2002 .

[3]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[4]  J. McCarthy.  A basis for a mathematical theory of computation, preliminary report , 1961, IRE-AIEE-ACM '61 (Western).

[5]  John McCarthy,et al.  A basis for a mathematical theory of computation, preliminary report , 1899, IRE-AIEE-ACM '61 (Western).

[6]  David M. Cerna,et al.  Predicting Space Requirements for a Stream Monitor Specification Language , 2016, RV.

[7]  Ping Li,et al.  The realization problems related to weighted transducers over strong bimonoids , 2014, 2014 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE).

[8]  Paul Gastin,et al.  Weighted automata and weighted logics , 2005, Theor. Comput. Sci..

[9]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[10]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[11]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[12]  Manfred Droste,et al.  Weighted finite automata over strong bimonoids , 2010, Inf. Sci..

[13]  J. Büchi.  Weak Second‐Order Arithmetic and Finite Automata , 1960 .

[14]  Maurice Nivat,et al.  Transduction des langages de Chomsky , 1968 .

[15]  M. Droste,et al.  Coverings and Decompositions of Semiring-Weighted Finite Transition Systems , 2012 .

[16]  Arnon Avron,et al.  Proof Systems for Reasoning about Computation Errors , 2009, Stud Logica.

[17]  M. Droste,et al.  Handbook of Weighted Automata , 2009 .

[18]  Manfred Droste,et al.  Determinization of weighted finite automata over strong bimonoids , 2010, Inf. Sci..