Weighted logics for unranked tree automata
DOI10.1007/S00224-009-9224-4zbMATH Open1226.03048OpenAlexW2040997422MaRDI QIDQ2429720FDOQ2429720
Authors: 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
Recommendations
- Weighted tree automata and weighted logics
- Weighted unranked tree automata over tree valuation monoids and their characterization by weighted logics
- Weighted Muller tree automata and weighted logics
- Term Rewriting and Applications
- Weighted automata and weighted logics
- Automata, Languages and Programming
- Weighted automata and weighted logics
- Logics for Unranked Trees: An Overview
- Automata, Languages and Programming
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
formal power seriesmonadic second-order logicXML queriesweighted logicstree seriesweighted tree automataunranked trees
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Database theory (68P15) Algebraic theory of languages and automata (68Q70) Logic in computer science (03B70)
Cites Work
- Title not available (Why is that?)
- One-unambiguous regular languages
- Handbook of weighted automata
- Query automata over finite trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the definition of a family of automata
- Title not available (Why is that?)
- Weak Second‐Order Arithmetic and Finite Automata
- Title not available (Why is that?)
- Decision Problems of Finite Automata Design and Related Arithmetics
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
- Tree acceptors and some of their applications
- Automata, Languages and Programming
- Logics for Unranked Trees: An Overview
- Automata, Languages and Programming
- Weighted automata and weighted logics
- Weighted Muller tree automata and weighted logics
- Weighted Logics for Nested Words and Algebraic Formal Power Series
- Weighted tree automata and weighted logics
- Weighted Logics for Traces
- Definable Transductions and Weighted Logics for Texts
- Recognizable formal power series on trees
- Weighted grammars and Kleene's theorem
- Weighted picture automata and weighted logics
- Weighted Automata and Weighted Logics with Discounting
- DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Title not available (Why is that?)
Cited In (24)
- Weighted tree automata and weighted logics
- Weighted Muller tree automata and weighted logics
- A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings
- Pebble weighted automata and weighted logics
- Definable transductions and weighted logics for texts
- Weighted automata and weighted logics with discounting
- A Büchi-like theorem for weighted tree automata over multioperator monoids
- Characterizing weighted MSO for trees by branching transitive closure logics
- Bottom-up unranked tree-to-graph transducers for translation into semantic graphs
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
- Effective optimization with weighted automata on decomposable trees
- A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties
- Characterizations of recognizable weighted tree languages by logic and bimorphisms
- Weighted unranked tree automata over tree valuation monoids and their characterization by weighted logics
- Weighted automata and logics meet computational complexity
- A Nivat theorem for weighted alternating automata over commutative semirings
- The supports of weighted unranked tree automata
- Weighted automata
- A Nivat theorem for quantitative automata on unranked trees
- A link between multioperator and tree valuation automata and logics
- Weighted automata and multi-valued logics over arbitrary bounded lattices
- A logic-based approach to incremental reasoning on multi-agent systems
- Weighted monadic Datalog
- Term Rewriting and Applications
This page was built for publication: Weighted logics for unranked tree automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2429720)
