Kleene and Büchi theorems for weighted forest languages over M-monoids
From MaRDI portal
Publication:2051789
DOI10.1016/J.IC.2021.104765OpenAlexW3160229782WikidataQ113872838 ScholiaQ113872838MaRDI QIDQ2051789FDOQ2051789
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
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Handbook of weighted automata
- Weak Second‐Order Arithmetic and Finite Automata
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
- Weighted tree automata and weighted logics
- A Kleene theorem for weighted tree automata
- On the Determinization of Weighted Finite Automata
- A Kleene theorem for weighted tree automata over distributive multioperator monoids
- Title not available (Why is that?)
- A Büchi-like theorem for weighted tree automata over multioperator 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
- A Kleene theorem for weighted tree automata over tree valuation monoids
- A Kleene Theorem for Forest Languages
Cited In (3)
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)
