Pages that link to "Item:Q3526417"
From MaRDI portal
The following pages link to A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata (Q3526417):
Displayed 16 items.
- Determinization of timed Petri nets behaviors (Q312642) (← links)
- Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring (Q764364) (← links)
- Finite sequentiality of unambiguous max-plus tree automata (Q2048206) (← links)
- Behaviour equivalent max-plus automata for timed Petri nets under open-loop race-policy semantics (Q2063100) (← links)
- What's decidable about weighted automata? (Q2064522) (← links)
- Max-plus automata (Q2074207) (← links)
- A contribution to the determinization of max-plus automata (Q2177784) (← links)
- Compositions of (max,+) automata (Q2348374) (← links)
- A disambiguation algorithm for weighted automata (Q2357105) (← links)
- Initial-state detectability and initial-state opacity of unambiguous weighted automata (Q2664211) (← links)
- Supervisory control of (max,+) automata: extensions towards applications (Q2799292) (← links)
- On Finite and Polynomial Ambiguity of Weighted Tree Automata (Q2817402) (← links)
- On the Disambiguation of Weighted Automata (Q2947428) (← links)
- (Q3304149) (← links)
- (Q5028476) (← links)
- (Q5155668) (← links)