Pages that link to "Item:Q2915544"
From MaRDI portal
The following pages link to The support of a recognizable series over a zero-sum free, commutative semiring is recognizable (Q2915544):
Displaying 17 items.
- Weighted restarting automata (Q1797778) (← links)
- On the supports of recognizable series over a field and a single letter alphabet (Q1944212) (← links)
- Recognizability of the support of recognizable series over the semiring of the integers is undecidable (Q1944933) (← links)
- Weighted automata (Q2074206) (← links)
- Weighted tree automata with constraints (Q2164002) (← links)
- Weighted automata with storage (Q2280328) (← links)
- An algebraic characterization of semirings for which the support of every recognizable series is recognizable (Q2447754) (← links)
- Weighted Symbolic Automata with Data Storage (Q2817389) (← links)
- Efficient weighted expressions conversion (Q3515463) (← links)
- Compositions with Constant Weighted Extended Tree Transducers (Q6072400) (← links)
- Weighted two-way transducers (Q6145527) (← links)
- Weighted tree automata with constraints (Q6151146) (← links)
- Compositions of Weighted Extended Tree Transducers — The Unambiguous Case (Q6154977) (← links)
- Pumping Lemmata for Recognizable Weighted Languages over Artinian Semirings (Q6204133) (← links)
- Solving the Weighted HOM-Problem With the Help of Unambiguity (Q6204136) (← links)
- Undecidability of the universal support problem for weighted automata over zero-sum-free commutative semirings (Q6548961) (← links)
- Finite sequentiality of finitely ambiguous max-plus tree automata (Q6614608) (← links)
