Weighted tree automata with constraints

DOI10.1007/978-3-031-05578-2_18OpenAlexW4285164036MaRDI QIDQ2164002

Andreas Maletti, Andreea-Teodora Nász

Publication date: 11 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-05578-2_18

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Weighted two-way transducers ⋮ Weighted two-way transducers ⋮ Weighted bottom-up and top-down tree transformations are incomparable ⋮ Solving the Weighted HOM-Problem With the Help of Unambiguity ⋮ Weighted tree automata with constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Grammatical picture generation. A tree-based approach. With CD-ROM.
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Tree acceptors and some of their applications
• The Supports of Weighted Unranked Tree Automata
• The Support of a Recognizable Series over a Zero-sum Free, Commutative Semiring is Recognizable
• Tree Automata, (Dis-)Equality Constraints and Term Rewriting
• On the definition of a family of automata
• Weighted Tree Automata and Tree Transducers
• Equality and disequality constraints on direct subterms in tree automata
• Implementation and Application of Automata
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Compiler Design

This page was built for publication: Weighted tree automata with constraints