Weighted tree automata with constraints

DOI10.1007/s00224-023-10144-warXiv2302.03434OpenAlexW4387307159MaRDI QIDQ6151146

Andreas Maletti, Andreea-Teodora Nász

Publication date: 9 February 2024

Published in: Theory of Computing Systems (Search for Journal in Brave)

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

zbMATH Keywords

closure propertiesweighted tree automatontree homomorphismweighted tree grammarHOM problemsubtree equality constraintsubtree inequality constraint

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Grammatical picture generation. A tree-based approach. With CD-ROM.
• Weighted tree automata with constraints
• 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 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
• Equality and disequality constraints on direct subterms in tree automata
• Implementation and Application of Automata
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Compiler Design
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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