Kleene and Büchi theorems for weighted forest languages over M-monoids

DOI10.1016/J.IC.2021.104765OpenAlexW3160229782WikidataQ113872838 ScholiaQ113872838MaRDI QIDQ2051789

Frederic Dörband

Publication date: 25 November 2021

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2021.104765

zbMATH Keywords

Kleene's theoremBüchi's theoremforest languagesrational forest expressionsweighted forest automata

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Büchi-like theorem for weighted tree automata over multioperator monoids
• Handbook of weighted automata
• Weighted tree automata and weighted logics
• A Kleene theorem for weighted tree automata
• A Kleene theorem for weighted tree automata over distributive multioperator monoids
• A Kleene theorem for weighted tree automata over tree valuation monoids
• A link between multioperator and tree valuation automata and logics
• Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics
• Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
• Weak Second‐Order Arithmetic and Finite Automata
• A Kleene Theorem for Forest Languages
• On the Determinization of Weighted Finite Automata
• Generalized finite automata theory with an application to a decision problem of second-order logic

This page was built for publication: Kleene and Büchi theorems for weighted forest languages over M-monoids