Pages that link to "Item:Q3098032"
From MaRDI portal
The following pages link to Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics (Q3098032):
Displayed 14 items.
- Weighted automata and logics for infinite nested words (Q515684) (← links)
- Characterizations of recognizable weighted tree languages by logic and bimorphisms (Q1797776) (← links)
- A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties (Q1797777) (← links)
- Weighted automata and weighted MSO logics for average and long-time behaviors (Q1932173) (← links)
- Kleene and Büchi theorems for weighted forest languages over M-monoids (Q2051789) (← links)
- A logic-based approach to incremental reasoning on multi-agent systems (Q2089459) (← links)
- Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids (Q2136289) (← links)
- A Kleene theorem for weighted tree automata over tree valuation monoids (Q2280327) (← links)
- A link between multioperator and tree valuation automata and logics (Q2355687) (← links)
- The complexity of computing the behaviour of lattice automata on infinite trees (Q2447756) (← links)
- Weighted Automata and Logics on Infinite Graphs (Q2817384) (← links)
- Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics (Q2947150) (← links)
- Valuations of Weighted Automata: Doing It in a Rational Way (Q3098044) (← links)
- A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices (Q6154974) (← links)