Weighted automata and multi-valued logics over arbitrary bounded lattices

DOI10.1016/j.tcs.2011.11.008zbMath1245.03060OpenAlexW2016928625MaRDI QIDQ764336

Heiko Vogler, Manfred Droste

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

zbMATH Keywords

monadic second-order logiclattice-valued logicformal power seriessemiringweighted automata

Mathematics Subject Classification ID

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

Related Items (33)

Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids ⋮ Weighted LTL with Discounting ⋮ WEIGHTED NESTED WORD AUTOMATA AND LOGICS OVER STRONG BIMONOIDS ⋮ McCarthy-Kleene fuzzy automata and MSO logics ⋮ Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics ⋮ Weighted automata and weighted MSO logics for average and long-time behaviors ⋮ Modelling Uncertainty in Architectures of Parametric Component-Based Systems ⋮ Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata ⋮ Model checking computation tree logic over finite lattices ⋮ A Nivat theorem for weighted picture automata and weighted MSO logics ⋮ Unnamed Item ⋮ A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices ⋮ Weighted Linear Dynamic Logic ⋮ Unnamed Item ⋮ Adding pebbles to weighted automata: easy specification \& efficient evaluation ⋮ The complexity of computing the behaviour of lattice automata on infinite trees ⋮ Parameterized model checking of weighted networks ⋮ On weighted first-order logics with discounting ⋮ Multi-weighted automata and MSO logic ⋮ Weighted automata and logics for infinite nested words ⋮ Model checking fuzzy computation tree logic ⋮ On High-Quality Synthesis ⋮ Unnamed Item ⋮ Weighted register automata and weighted logic on data words ⋮ Model checking of linear-time properties in multi-valued systems ⋮ A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic ⋮ The relationships among several forms of weighted finite automata over strong bimonoids ⋮ Linear weighted tree automata with storage and inverse linear tree homomorphisms ⋮ TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS ⋮ Weighted operator precedence languages ⋮ Weighted automata ⋮ THE CHOMSKY-SCHÜTZENBERGER THEOREM FOR QUANTITATIVE CONTEXT-FREE LANGUAGES ⋮ Characterizing weighted MSO for trees by branching transitive closure logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automata theory based on quantum logic: Some characterizations
• Handbook of weighted automata
• Weighted automata and weighted logics with discounting
• Weighted finite automata over strong bimonoids
• Weighted tree automata and weighted logics
• Automata theory based on complete residuated lattice-valued logic
• On aperiodic and star-free formal power series in partially commuting variables
• On rational series and rational languages
• Automata theory based on quantum logic. I
• Notes on automata theory based on quantum logic
• Weighted automata and weighted logics
• Weighted logics for unranked tree automata
• Weighted picture automata and weighted logics
• Automata theory based on quantum logic: reversibilities and pushdown automata
• A theory of computation based on quantum logic. I
• Alternating Weighted Automata
• Probabilistic Weighted Automata
• Weak Second‐Order Arithmetic and Finite Automata
• On the definition of a family of automata
• Weighted Logics for Traces
• PURE AND O-SUBSTITUTION
• Weighted Logics for Nested Words and Algebraic Formal Power Series
• Quantitative Languages
• Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices
• Weighted versus Probabilistic Logics
• Weighted Timed MSO Logics
• Decision Problems of Finite Automata Design and Related Arithmetics
• Finite automata based on quantum logic and monadic second-order quantum logic
• On finite monoids having only trivial subgroups
• Definable Transductions and Weighted Logics for Texts
• Weighted Distributed Systems and Their Logics
• Lattice Automata
• Automata, Languages and Programming
• Logic Programming
• Automata, Languages and Programming
• CONCUR 2003 - Concurrency Theory

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