Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics

DOI10.1007/978-3-319-23021-4_9zbMath1465.68141OpenAlexW2293780282MaRDI QIDQ2947150

Doreen Heusel, Heiko Vogler, Manfred Droste

Publication date: 22 September 2015

Published in: Algebraic Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23021-4_9

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70)

Related Items (6)

Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids ⋮ Unnamed Item ⋮ 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 operator precedence languages ⋮ Weighted Operator Precedence Languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Forward and backward application of symbolic tree transducers
• Weighted automata and multi-valued logics over arbitrary bounded lattices
• Handbook of weighted automata
• Weighted automata and weighted logics with discounting
• Definable transductions and weighted logics for texts
• Weighted tree automata and weighted logics
• Weighted automata and weighted MSO logics for average and long-time behaviors
• Weighted automata and weighted logics
• Weighted logics for unranked tree automata
• Weighted picture automata and weighted logics
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Expressiveness and Closure Properties for Quantitative Languages
• Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
• Alternating Weighted Automata
• Probabilistic Weighted Automata
• Weighted Logics for Traces
• Symbolic Tree Transducers
• Quantitative Languages
• Bisimulation Minimisation of Weighted Automata on Unranked Trees
• Weighted versus Probabilistic Logics
• Weighted Tree Automata and Tree Transducers
• Weighted Logics for Nested Words and Algebraic Formal Power Series
• Extending two-variable logic on data trees with order on data values and its automata
• Automata, Languages and Programming
• One-unambiguous regular languages

This page was built for publication: Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics