Weighted Tree Automata and Tree Transducers

DOI10.1007/978-3-642-01492-5_9zbMath1484.68085OpenAlexW1534391801MaRDI QIDQ5072551

Heiko Vogler, Zoltán Fülöp

Publication date: 28 April 2022

Published in: Monographs in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-01492-5_9

Mathematics Subject Classification ID

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

Related Items (31)

Crisp-determinization of weighted tree automata over strong bimonoids ⋮ Compositions of constant weighted extended tree transducers ⋮ Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids ⋮ Weighted tree automata with constraints ⋮ Modeling Quantitative Aspects of Concurrent Systems Using Weighted Petri Net Transducers ⋮ Simulation relations for pattern matching in directed graphs ⋮ Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics ⋮ Combinatory categorial grammars as generators of weighted forests ⋮ Ambiguity Hierarchies for Weighted Tree Automata ⋮ Compositions with Constant Weighted Extended Tree Transducers ⋮ Multityped abstract categorial grammars and their composition ⋮ The generative power of delegation networks ⋮ Efficient enumeration of weighted tree languages over the tropical semiring ⋮ A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings ⋮ Unnamed Item ⋮ A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices ⋮ Compositions of Weighted Extended Tree Transducers — The Unambiguous Case ⋮ Weighted bottom-up and top-down tree transformations are incomparable ⋮ Solving the Weighted HOM-Problem With the Help of Unambiguity ⋮ Multilinear representations of free pros ⋮ Compositions of Tree-to-Tree Statistical Machine Translation Models ⋮ Sequentiality of group-weighted tree automata ⋮ Weighted tree automata with constraints ⋮ A Kleene theorem for weighted tree automata over tree valuation monoids ⋮ Characterizations of recognizable weighted tree languages by logic and bimorphisms ⋮ Finite sequentiality of unambiguous max-plus tree automata ⋮ Approximate minimization of weighted tree automata ⋮ Principal abstract families of weighted tree languages ⋮ Hyper-optimization for deterministic tree automata ⋮ Characterizing weighted MSO for trees by branching transitive closure logics ⋮ Ambiguity hierarchies for weighted tree automata

This page was built for publication: Weighted Tree Automata and Tree Transducers