The weighted HOM-problem over fields

DOI10.1016/j.jcss.2024.103616MaRDI QIDQ6671672FDOQ6671672

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Automata for XML -- a survey
• 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
• 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
• On injectivity of deterministic top-down tree transducers
• Recognizable formal power series on trees
• Title not available (Why is that?)
• Représentations matricielles des séries d'arbre reconnaissables
• Effective construction of the syntactic algebra of a recognizable series on trees
• On a problem of formal logic.
• Graph automata
• Grammatical picture generation. A tree-based approach. With CD-ROM.
• Compiler design. Syntactic and semantic analysis
• Weighted automata
• Title not available (Why is that?)
• Weighted tree automata with constraints
• The HOM Problem is EXPTIME-Complete
• Weighted tree automata with constraints
• 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)