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

DOI10.1016/J.IC.2021.104765MaRDI QIDQ2051789zbMATH OpenOpenAlexWikidataFDO

Authors 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

Büchi's theoremforest languagesKleene's theoremrational forest expressionsweighted forest automata

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• A Büchi-like theorem for weighted tree automata over multioperator monoids
• A Kleene theorem for weighted tree automata over tree valuation monoids
• A Kleene theorem for weighted tree automata
• Characterizations of recognizable weighted tree languages by logic and bimorphisms
• A Kleene theorem for weighted tree automata over tree valuation monoids

Cites work

• A Büchi-like theorem for weighted tree automata over multioperator monoids
• A Kleene Theorem for Forest Languages
• 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
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Handbook of weighted automata
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 1358710 (Why is no real title available?)
• scientific article; zbMATH DE number 6124028 (Why is no real title available?)
• On the Determinization of Weighted Finite Automata
• Weak Second‐Order Arithmetic and Finite Automata
• Weighted tree automata and weighted logics
• Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
• Weighted unranked tree automata over tree valuation monoids and their characterization by weighted logics

Cited in

(3)

• Rational weighted tree languages with storage and the Kleene-Goldstine theorem
• A link between multioperator and tree valuation automata and logics
• A Büchi-like theorem for weighted tree automata over multioperator monoids

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

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