Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
From MaRDI portal
Publication:3098032
DOI10.1007/978-3-642-24897-9_2zbMath1331.68127OpenAlexW202483378MaRDI QIDQ3098032
Steffen Märcker, Ingmar Meinecke, Doreen Götze, Manfred Droste
Publication date: 11 November 2011
Published in: Algebraic Foundations in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24897-9_2
Formal languages and automata (68Q45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05)
Related Items (14)
Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids ⋮ 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 ⋮ A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices ⋮ The complexity of computing the behaviour of lattice automata on infinite trees ⋮ Weighted automata and logics for infinite nested words ⋮ A Kleene theorem for weighted tree automata over tree valuation monoids ⋮ Characterizations of recognizable weighted tree languages by logic and bimorphisms ⋮ A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties ⋮ Kleene and Büchi theorems for weighted forest languages over M-monoids ⋮ Weighted Automata and Logics on Infinite Graphs ⋮ Valuations of Weighted Automata: Doing It in a Rational Way ⋮ A logic-based approach to incremental reasoning on multi-agent systems ⋮ A link between multioperator and tree valuation automata and 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
- Towards more realistic (e.g., non-associative) ``and - and ``or-operations in fuzzy logic
- A Büchi-like theorem for weighted tree automata over multioperator monoids
- Constructions effectives sur les séries formelles d'arbres. (Effective constructions on formal tree series)
- The rank of a formal tree power series
- Handbook of weighted automata
- Weighted finite automata over strong bimonoids
- Weighted tree automata and weighted logics
- Effective construction of the syntactic algebra of a recognizable series on trees
- Weighted grammars and Kleene's theorem
- Varieties of formal series on trees and Eilenberg's theorem
- Recognizable formal power series on trees
- Finite tree automata with cost functions
- Positive tree representations and applications to tree automata
- A Kleene theorem for weighted tree automata
- Context-free series on trees
- Fuzzy tree language recognizability
- A Kleene theorem for weighted tree automata over distributive multioperator monoids
- Weighted automata and weighted logics
- Weighted logics for unranked tree automata
- Tree acceptors and some of their applications
- The logic of quantum mechanics
- Expressiveness and Closure Properties for Quantitative Languages
- Models for Quantitative Distributed Systems and Multi-Valued Logics
- Représentations matricielles des séries d'arbre reconnaissables
- Alternating Weighted Automata
- Probabilistic Weighted Automata
- Weak Second‐Order Arithmetic and Finite Automata
- Quantitative Languages
- Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices
- Describing Average- and Longtime-Behavior by Weighted MSO Logics
- Weighted versus Probabilistic Logics
- Decision Problems of Finite Automata Design and Related Arithmetics
- Lattice fuzzy logics
- Logic Programming
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Automata, Languages and Programming
This page was built for publication: Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
