Weighted automata and multi-valued logics over arbitrary bounded lattices

DOI10.1016/J.TCS.2011.11.008zbMATH Open1245.03060OpenAlexW2016928625MaRDI QIDQ764336FDOQ764336

Authors: Manfred Droste, Heiko Vogler 

Publication date: 13 March 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.11.008

Recommendations

• Kleene and Büchi theorems for weighted automata and multi-valued logics over arbitrary bounded lattices
• Finite automata with membership values in lattices and monadic second-order lattice-valued logic
• Weighted automata and weighted logics
• Weighted Automata and Weighted Logics on Infinite Words
• Weighted automata and weighted logics on infinite words

zbMATH Keywords

formal power seriesmonadic second-order logicsemiringweighted automatalattice-valued logic

Mathematics Subject Classification ID

Many-valued logic (03B50) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70)

Cites Work

• Title not available (Why is that?)
• A treatise on many-valued logics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Automata, Languages and Programming
• Title not available (Why is that?)
• Multi-valued model checking via classical model checking.
• Handbook of weighted automata
• Title not available (Why is that?)
• Automata theory based on complete residuated lattice-valued logic
• On the definition of a family of automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• On finite monoids having only trivial subgroups
• On rational series and rational languages
• Weak Second‐Order Arithmetic and Finite Automata
• Title not available (Why is that?)
• Decision Problems of Finite Automata Design and Related Arithmetics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Weighted versus Probabilistic Logics
• Title not available (Why is that?)
• Alternating Weighted Automata
• Quantitative Languages
• Title not available (Why is that?)
• Automata theory based on quantum logic. I
• Automata theory based on quantum logic: reversibilities and pushdown automata
• A theory of computation based on quantum logic. I
• Kleene and Büchi theorems for weighted automata and multi-valued logics over arbitrary bounded lattices
• Finite automata based on quantum logic and monadic second-order quantum logic
• Lattice Automata
• Automata, Languages and Programming
• Automata theory based on quantum logic: Some characterizations
• Weighted finite automata over strong bimonoids
• Notes on automata theory based on quantum logic
• Weighted automata and weighted logics
• Weighted Muller tree automata and weighted logics
• Weighted logics for unranked tree automata
• Weighted Logics for Nested Words and Algebraic Formal Power Series
• Title not available (Why is that?)
• Weighted tree automata and weighted logics
• First-order definable languages
• Weighted Logics for Traces
• Weighted Timed MSO Logics
• Definable Transductions and Weighted Logics for Texts
• Weighted Distributed Systems and Their Logics
• Weighted picture automata and weighted logics
• Title not available (Why is that?)
• Weighted automata and weighted logics with discounting
• Probabilistic Weighted Automata
• Title not available (Why is that?)
• PURE AND O-SUBSTITUTION
• Title not available (Why is that?)
• Logic Programming
• On aperiodic and star-free formal power series in partially commuting variables

Cited In (43)

• TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
• Linear-time logics -- a coalgebraic perspective
• Model checking of linear-time properties in multi-valued systems
• Weighted automata and weighted MSO logics for average and long-time behaviors
• The Chomsky-Schützenberger theorem for quantitative context-free languages
• Parameterized model checking of weighted networks
• McCarthy-Kleene fuzzy automata and MSO logics
• On weighted first-order logics with discounting
• A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices
• Weighted Linear Dynamic Logic
• Weighted linear dynamic logic
• Lattice Automata
• Title not available (Why is that?)
• Characterizing weighted MSO for trees by branching transitive closure logics
• Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
• A translation of weighted LTL formulas to weighted Büchi automata over \(\omega\)-valuation monoids
• On high-quality synthesis
• Weighted nested word automata and logics over strong bimonoids
• Weighted nested word automata and logics over strong bimonoids
• Modelling Uncertainty in Architectures of Parametric Component-Based Systems
• Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
• Local finiteness in t-norm bimonoids: overlap cases
• Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata
• Kleene and Büchi theorems for weighted automata and multi-valued logics over arbitrary bounded lattices
• Model checking computation tree logic over finite lattices
• Weighted register automata and weighted logic on data words
• Linear weighted tree automata with storage and inverse linear tree homomorphisms
• A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties
• Weighted unranked tree automata over tree valuation monoids and their characterization by weighted logics
• Weighted operator precedence languages
• The relationships among several forms of weighted finite automata over strong bimonoids
• Weighted automata
• Multi-valued automata and their applications
• Finite automata with membership values in lattices and monadic second-order lattice-valued logic
• A Nivat theorem for weighted picture automata and weighted MSO logic
• Multi-weighted automata and MSO logic
• Adding pebbles to weighted automata: easy specification \& efficient evaluation
• A Nivat theorem for weighted picture automata and weighted MSO logics
• Title not available (Why is that?)
• The complexity of computing the behaviour of lattice automata on infinite trees
• Weighted automata and logics for infinite nested words
• Weighted LTL with discounting
• Model checking fuzzy computation tree logic

This page was built for publication: Weighted automata and multi-valued logics over arbitrary bounded lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764336)