The following pages link to (Q3515223):
Displayed 14 items.
- 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 MSO logics for average and long-time behaviors (Q1932173) (← links)
- Weighted automata (Q2074206) (← links)
- Weighted logics for unranked tree automata (Q2429720) (← 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)
- 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)