Pages that link to "Item:Q5390010"
From MaRDI portal
The following pages link to Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata (Q5390010):
Displayed 25 items.
- Rigorous approximated determinization of weighted automata (Q385026) (← 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)
- Determinisability of unary weighted automata over the rational numbers (Q2055977) (← links)
- Max-plus automata (Q2074207) (← links)
- Finite ambiguity and finite sequentiality in weighted automata over fields (Q2097226) (← links)
- A robust class of linear recurrence sequences (Q2105454) (← links)
- New representations for (max,+) automata with applications to performance evaluation and control of discrete event systems (Q2348373) (← links)
- A disambiguation algorithm for weighted automata (Q2357105) (← links)
- When are emptiness and containment decidable for probabilistic automata? (Q2662671) (← links)
- On the Disambiguation of Weighted Automata (Q2947428) (← links)
- Degree of Sequentiality of Weighted Automata (Q2988370) (← links)
- (Q3304149) (← links)
- Factorization Forests (Q3637210) (← links)
- How to Tackle Integer Weighted Automata Positivity (Q3646253) (← links)
- Limited Non-determinism Hierarchy of Counter Automata (Q4910447) (← links)
- Multi-Valued Reasoning about Reactive Systems (Q5060674) (← links)
- (Q5090506) (← links)
- (Q5111268) (← links)
- (Q5155668) (← links)
- Unambiguity in Automata Theory (Q5500675) (← links)
- Weak Cost Register Automata are Still Powerful (Q5859644) (← links)
- Polynomially ambiguous unary weighted automata over fields (Q6038711) (← links)
- Bideterministic weighted automata (Q6108730) (← links)
- Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata (Q6154973) (← links)