Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices

DOI10.1007/978-3-642-14455-4_16zbMath1250.03063OpenAlexW1746593892MaRDI QIDQ3584890

Heiko Vogler, Manfred Droste

Publication date: 31 August 2010

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14455-4_16

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Many-valued logic (03B50)

Related Items (11)

Bisimulations for fuzzy automata ⋮ A Büchi-like theorem for weighted tree automata over multioperator monoids ⋮ Construction of fuzzy automata from fuzzy regular expressions ⋮ An improved algorithm for determinization of weighted and fuzzy automata ⋮ Determinization of weighted finite automata over strong bimonoids ⋮ Regular Expressions on Average and in the Long Run ⋮ Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics ⋮ Valuations of Weighted Automata: Doing It in a Rational Way ⋮ Weighted automata and multi-valued logics over arbitrary bounded lattices ⋮ Models for quantitative distributed systems and multi-valued logics ⋮ Characterizing weighted MSO for trees by branching transitive closure logics

This page was built for publication: Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices