Solving the Weighted HOM-Problem With the Help of Unambiguity

DOI10.4204/eptcs.386.16arXiv2309.02761OpenAlexW4386399953MaRDI QIDQ6204136

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Grammatical picture generation. A tree-based approach. With CD-ROM.
• Disambiguation of weighted tree automata
• Weighted tree automata with constraints
• A disambiguation algorithm for weighted automata
• Graph automata
• 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 HOM problem is decidable
• The Support of a Recognizable Series over a Zero-sum Free, Commutative Semiring is Recognizable
• On the definition of a family of automata
• Weighted Tree Automata and Tree Transducers
• Generalized finite automata theory with an application to a decision problem of second-order logic
• The HOM Problem is EXPTIME-Complete
• Compiler Design