Pages that link to "Item:Q5072546"
From MaRDI portal
The following pages link to Rational and Recognisable Power Series (Q5072546):
Displayed 22 items.
- A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata (Q1797781) (← links)
- Recognizability of the support of recognizable series over the semiring of the integers is undecidable (Q1944933) (← links)
- Determinisability of unary weighted automata over the rational numbers (Q2055977) (← links)
- Preservation of normality by transducers (Q2064521) (← links)
- On some decidability questions concerning supports of rational series (Q2094367) (← links)
- Ambiguity hierarchies for weighted tree automata (Q2117674) (← links)
- Context-free coalgebras (Q2341705) (← links)
- Hyper-optimization for deterministic tree automata (Q2344747) (← links)
- Adding pebbles to weighted automata: easy specification \& efficient evaluation (Q2447753) (← links)
- Rational elements of summation semirings (Q2663048) (← links)
- On Power Series over a Graded Monoid (Q2944878) (← links)
- Why We Need Semirings in Automata Theory (Extended Abstract) (Q2947145) (← links)
- (Q5028448) (← links)
- Weighted Automata and Weighted Logics (Q5072547) (← links)
- Coalgebras for Bisimulation of Weighted Automata over Semirings (Q5883750) (← links)
- Polynomially ambiguous unary weighted automata over fields (Q6038711) (← links)
- Ambiguity Hierarchies for Weighted Tree Automata (Q6070750) (← links)
- Bideterministic weighted automata (Q6108730) (← links)
- The net automaton of a rational expression (Q6109019) (← links)
- Weighted Linear Dynamic Logic (Q6154979) (← links)
- Bideterministic weighted automata (Q6186321) (← links)
- Pumping Lemmata for Recognizable Weighted Languages over Artinian Semirings (Q6204133) (← links)