Kleene and Büchi theorems for weighted automata and multi-valued logics over arbitrary bounded lattices

  • Authors:
  • Manfred Droste;Heiko Vogler

  • Affiliations:
  • Institute of Computer Science, Leipzig University, Leipzig, Germany;Department of Computer Science, TU Dresden, Dresden, Germany

  • Venue:
  • DLT'10 Proceedings of the 14th international conference on Developments in language theory
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We show that L-weighted automata, L-rational series, and L-valued monadic second-order logic have the same expressive power, for any bounded lattice L and for finite and infinite words. This extends classical results of Kleene and Büchi to arbitrary bounded lattices, without any distributivity assumption that is fundamental in the theory of weighted automata over semirings. In fact, we obtain these results for large classes of strong bimonoids which properly contain all bounded lattices.