Pages that link to "Item:Q4786328"
From MaRDI portal
The following pages link to DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA (Q4786328):
Displayed 16 items.
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton (Q703577) (← links)
- Component simulation-based substitutivity managing QoS and composition issues (Q988175) (← links)
- Finite sequentiality of unambiguous max-plus tree automata (Q2048206) (← links)
- What's decidable about weighted automata? (Q2064522) (← links)
- Max-plus automata (Q2074207) (← links)
- Sequential? (Q2490822) (← links)
- On Finite and Polynomial Ambiguity of Weighted Tree Automata (Q2817402) (← links)
- DETERMINATIONS OF WEIGHTED FINITE AUTOMATA OVER COMMUTATIVE IDEMPOTENT MF-SEMIRINGS (Q2888836) (← links)
- Series which are both max-plus and min-plus rational are unambiguous (Q3374753) (← links)
- Weight Assignment Logic (Q3451120) (← links)
- A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata (Q3526417) (← links)
- How to Tackle Integer Weighted Automata Positivity (Q3646253) (← links)
- (Q5090506) (← links)
- (Q5092439) (← links)
- (Q5111268) (← links)
- Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata (Q6154973) (← links)