The weighted HOM-problem over fields

DOI10.1016/j.jcss.2024.103616MaRDI QIDQ6671672zbMATH OpenFDO

Authors Andreea-Teodora Nász

Publication date 27 January 2025

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

regular tree languagesdecision problemweighted tree automatatree homomorphismsweighted automata over fields

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• Solving the Weighted HOM-Problem With the Help of Unambiguity
• Weighted tree automata with constraints
• The HOM problem is decidable
• The HOM problem is decidable

Cites work

• scientific article; zbMATH DE number 3924161 (Why is no real title available?)
• scientific article; zbMATH DE number 3588051 (Why is no real title available?)
• scientific article; zbMATH DE number 1257742 (Why is no real title available?)
• scientific article; zbMATH DE number 1354999 (Why is no real title available?)
• scientific article; zbMATH DE number 1358710 (Why is no real title available?)
• scientific article; zbMATH DE number 794243 (Why is no real title available?)
• Automata for XML -- a survey
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Compiler design. Syntactic and semantic analysis
• Effective construction of the syntactic algebra of a recognizable series on trees
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Grammatical picture generation. A tree-based approach. With CD-ROM.
• Graph automata
• On a problem of formal logic.
• On injectivity of deterministic top-down tree transducers
• On the definition of a family of automata
• Recognizable formal power series on trees
• Représentations matricielles des séries d'arbre reconnaissables
• Solving the Weighted HOM-Problem With the Help of Unambiguity
• The HOM Problem is EXPTIME-Complete
• The HOM problem is decidable
• The HOM problem is decidable
• Tree acceptors and some of their applications
• Weighted automata
• Weighted tree automata and tree transducers
• Weighted tree automata with constraints
• Weighted tree automata with constraints

Cited in

(1)

• Solving the Weighted HOM-Problem With the Help of Unambiguity

This page was built for publication: The weighted HOM-problem over fields

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