Pages that link to "Item:Q911788"
From MaRDI portal
The following pages link to Effective construction of the syntactic algebra of a recognizable series on trees (Q911788):
Displaying 21 items.
- Varieties of recognizable tree series over fields (Q627171) (← links)
- A Büchi-like theorem for weighted tree automata over multioperator monoids (Q692910) (← links)
- Constructions effectives sur les séries formelles d'arbres. (Effective constructions on formal tree series) (Q751831) (← links)
- Equational weighted tree transformations (Q766185) (← links)
- Definable transductions and weighted logics for texts (Q844894) (← links)
- Weighted tree automata and weighted logics (Q860890) (← links)
- Minimizing deterministic weighted tree automata (Q1041045) (← links)
- Recognizable formal series on trees and cofree coalgebraic systems (Q1295934) (← links)
- On two families of forests (Q1323385) (← links)
- Weighted automata (Q2074206) (← links)
- Fuzzy tree automata (Q2372277) (← links)
- On Finite and Polynomial Ambiguity of Weighted Tree Automata (Q2817402) (← links)
- Minimisation of Multiplicity Tree Automata (Q2949446) (← links)
- Simulations of Weighted Tree Automata (Q3073652) (← links)
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics (Q3098032) (← links)
- Rational Transformations and a Kleene Theorem for Power Series over Rational Monoids (Q3098035) (← links)
- THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA (Q3224952) (← links)
- Minimizing Deterministic Weighted Tree Automata (Q3540127) (← links)
- On the syntactic complexity of tree series (Q3566351) (← links)
- Some remarks on recognizable treeseries (Q4240621) (← links)
- The weighted HOM-problem over fields (Q6671672) (← links)
