Solving the Weighted HOM-Problem With the Help of Unambiguity

DOI10.4204/EPTCS.386.16arXiv2309.02761OpenAlexW4386399953MaRDI QIDQ6204136FDOQ6204136

Authors: Andreea-Teodora Nász 

Publication date: 9 April 2024

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

Full work available at URL: https://arxiv.org/abs/2309.02761

Recommendations

• The weighted HOM-problem over fields
• Weighted tree automata with constraints
• 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?)
• Generalized finite automata theory with an application to a decision problem of second-order logic
• 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?)
• The HOM problem is decidable
• Graph automata
• Grammatical picture generation. A tree-based approach. With CD-ROM.
• Compiler design. Syntactic and semantic analysis
• The support of a recognizable series over a zero-sum free, commutative semiring is recognizable
• The HOM problem is decidable
• A disambiguation algorithm for weighted automata
• Disambiguation of weighted tree automata
• Weighted tree automata with constraints
• The supports of weighted unranked tree automata
• The HOM Problem is EXPTIME-Complete

Cited In (1)

• The weighted HOM-problem over fields

This page was built for publication: Solving the Weighted HOM-Problem With the Help of Unambiguity

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