Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices
From MaRDI portal
Publication:3584890
DOI10.1007/978-3-642-14455-4_16zbMath1250.03063MaRDI QIDQ3584890
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
Related Items
Bisimulations for fuzzy automata, An improved algorithm for determinization of weighted and fuzzy automata, A Büchi-like theorem for weighted tree automata over multioperator monoids, Weighted automata and multi-valued logics over arbitrary bounded lattices, Determinization of weighted finite automata over strong bimonoids, Construction of fuzzy automata from fuzzy regular expressions, Characterizing weighted MSO for trees by branching transitive closure logics, Models for quantitative distributed systems and multi-valued logics, 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