Weighted logics for unranked tree automata

DOI10.1007/s00224-009-9224-4zbMath1226.03048OpenAlexW2040997422MaRDI QIDQ2429720

Heiko Vogler, Manfred Droste

Publication date: 1 April 2011

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-009-9224-4

zbMATH Keywords

monadic second-order logicformal power seriesXML queriesweighted logicstree seriesweighted tree automataunranked trees

Mathematics Subject Classification ID

Database theory (68P15) Formal languages and automata (68Q45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70)

Related Items

Weighted automata and weighted logics with discounting, Definable transductions and weighted logics for texts, Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics, A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings, Weighted automata and logics for infinite nested words, Effective optimization with weighted automata on decomposable trees, A Büchi-like theorem for weighted tree automata over multioperator monoids, Pebble Weighted Automata and Weighted Logics, Bottom-up unranked tree-to-graph transducers for translation into semantic graphs, 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, Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics, Weighted automata and multi-valued logics over arbitrary bounded lattices, Weighted automata, A logic-based approach to incremental reasoning on multi-agent systems, 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
• Handbook of weighted automata
• Weighted tree automata and weighted logics
• Weighted grammars and Kleene's theorem
• Recognizable formal power series on trees
• Query automata over finite trees
• Weighted automata and weighted logics
• Weighted picture automata and weighted logics
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Tree acceptors and some of their applications
• Weak Second‐Order Arithmetic and Finite Automata
• On the definition of a family of automata
• Weighted Logics for Traces
• Weighted Automata and Weighted Logics with Discounting
• Weighted Logics for Nested Words and Algebraic Formal Power Series
• DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA
• Decision Problems of Finite Automata Design and Related Arithmetics
• Logics for Unranked Trees: An Overview
• Definable Transductions and Weighted Logics for Texts
• Automata, Languages and Programming
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Automata, Languages and Programming
• One-unambiguous regular languages