Pages that link to "Item:Q703577"
From MaRDI portal
The following pages link to Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton (Q703577):
Displayed 36 items.
- Determinization of timed Petri nets behaviors (Q312642) (← links)
- Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring (Q764364) (← links)
- Component simulation-based substitutivity managing QoS and composition issues (Q988175) (← links)
- Multiple context-free tree grammars: lexicalization and characterization (Q1749480) (← links)
- Finite sequentiality of unambiguous max-plus tree automata (Q2048206) (← links)
- Max-plus automata (Q2074207) (← links)
- Disambiguation of weighted tree automata (Q2096595) (← links)
- Finite ambiguity and finite sequentiality in weighted automata over fields (Q2097226) (← links)
- A robust class of linear recurrence sequences (Q2105454) (← links)
- Ambiguity hierarchies for weighted tree automata (Q2117674) (← links)
- Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids (Q2136289) (← links)
- Permutability of matrices over bipotent semirings (Q2153501) (← links)
- New representations for (max,+) automata with applications to performance evaluation and control of discrete event systems (Q2348373) (← links)
- Compositions of (max,+) automata (Q2348374) (← links)
- A disambiguation algorithm for weighted automata (Q2357105) (← links)
- Sequential? (Q2490822) (← links)
- Supervisory control of (max,+) automata: extensions towards applications (Q2799292) (← links)
- On Determinism and Unambiguity of Weighted Two-Way Automata (Q2800415) (← links)
- On Finite and Polynomial Ambiguity of Weighted Tree Automata (Q2817402) (← links)
- DETERMINATIONS OF WEIGHTED FINITE AUTOMATA OVER COMMUTATIVE IDEMPOTENT MF-SEMIRINGS (Q2888836) (← links)
- On the Disambiguation of Weighted Automata (Q2947428) (← 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)
- (Q5028476) (← links)
- (Q5090506) (← links)
- (Q5092440) (← links)
- (Q5111268) (← links)
- (Q5155668) (← links)
- Unambiguity in Automata Theory (Q5500675) (← links)
- Decidable weighted expressions with Presburger combinators (Q5915759) (← links)
- Polynomially ambiguous unary weighted automata over fields (Q6038711) (← links)
- Ambiguity Hierarchies for Weighted Tree Automata (Q6070750) (← links)
- Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata (Q6154973) (← links)