The following pages link to Finite-valued distance automata (Q1341750):
Displayed 15 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)
- Exponential upper and lower bounds for the order of a regular language (Q1341751) (← links)
- Max-plus automata (Q2074207) (← links)
- Sequential? (Q2490822) (← links)
- Decomposing a $k$-valued transducer into $k$ unambiguous ones (Q3126010) (← links)
- (Q3304149) (← links)
- Series which are both max-plus and min-plus rational are unambiguous (Q3374753) (← 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)
- Limited Non-determinism Hierarchy of Counter Automata (Q4910447) (← links)
- (Q5111268) (← links)
- (Q5155668) (← links)
- Distance desert automata and the star height problem (Q5313718) (← links)
- Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata (Q6154973) (← links)