Weighted tree automata with constraints

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

Authors: 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

Recommendations

• The weighted HOM-problem over fields
• Solving the Weighted HOM-Problem With the Help of Unambiguity
• The HOM problem is decidable
• The HOM problem is decidable

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• 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?)
• Title not available (Why is that?)
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Equality and disequality constraints on direct subterms in tree automata
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Weighted tree automata and tree transducers
• Tree acceptors and some of their applications
• Title not available (Why is that?)
• Weighted extended tree transducers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Implementation and Application of Automata
• Title not available (Why is that?)
• Grammatical picture generation. A tree-based approach. With CD-ROM.
• Compiler design. Syntactic and semantic analysis
• Title not available (Why is that?)
• The support of a recognizable series over a zero-sum free, commutative semiring is recognizable
• The HOM problem is decidable
• The supports of weighted unranked tree automata
• Tree automata, (dis-)equality constraints and term rewriting. What's new?

Cited In (13)

• Weighted two-way transducers
• Weighted Languages Recognizable by Weighted Tree Automata
• Bottom-Up Tree Automata with Term Constraints
• Visibly Tree Automata with Memory and Constraints
• Automated Induction with Constrained Tree Automata
• Weighted tree automata with constraints
• Title not available (Why is that?)
• Weighted bottom-up and top-down tree transformations are incomparable
• Solving the Weighted HOM-Problem With the Help of Unambiguity
• DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA
• Title not available (Why is that?)
• The weighted HOM-problem over fields
• Weighted two-way transducers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2164002)