Pages that link to "Item:Q3515223"
From MaRDI portal
The following pages link to Weighted Muller tree automata and weighted logics (Q3515223):
Displaying 21 items.
- Multi-weighted automata and MSO logic (Q504993) (← links)
- A Büchi-like theorem for weighted tree automata over multioperator monoids (Q692910) (← links)
- Automata-based axiom pinpointing (Q707741) (← links)
- Weighted automata and multi-valued logics over arbitrary bounded lattices (Q764336) (← links)
- Weighted automata and weighted logics with discounting (Q840767) (← links)
- Definable transductions and weighted logics for texts (Q844894) (← links)
- Weighted automata and weighted logics on infinite words (Q845080) (← links)
- Weighted tree automata and weighted logics (Q860890) (← links)
- Characterizations of recognizable weighted tree languages by logic and bimorphisms (Q1797776) (← links)
- Weighted automata and weighted MSO logics for average and long-time behaviors (Q1932173) (← links)
- Weighted automata (Q2074206) (← links)
- A link between multioperator and tree valuation automata and logics (Q2355687) (← links)
- Weighted logics for unranked tree automata (Q2429720) (← links)
- Axiomatizing weighted synchronization trees and weighted bisimilarity (Q2447752) (← links)
- Weighted Automata and Logics on Infinite Graphs (Q2817384) (← links)
- On Finite and Polynomial Ambiguity of Weighted Tree Automata (Q2817402) (← links)
- Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics (Q2947150) (← links)
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics (Q3098032) (← links)
- DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA (Q3634180) (← links)
- Weighted Automata and Weighted Logics (Q5072547) (← links)
- Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in $$\mathcal {FL}_0$$ (Q5738984) (← links)
