Pages that link to "Item:Q1575957"
From MaRDI portal
The following pages link to New upper bounds to the limitedness of distance automata (Q1575957):
Displaying 13 items.
- Approximate comparison of functions computed by distance automata (Q290904) (← links)
- Limitedness theorem on finite automata with distance functions: An algebraic proof (Q807031) (← links)
- Improved limitedness theorems on finite automata with distance functions (Q908702) (← links)
- Bounded regular path queries in view-based data integration (Q989472) (← links)
- A note on finitely ambiguous distance automata (Q1209373) (← links)
- The limitedness problem on distance automata: Hashiguchi's method revisited (Q1884970) (← links)
- What's decidable about weighted automata? (Q2064522) (← links)
- Regular path queries under approximate semantics (Q2502162) (← links)
- Approximate comparison of distance automata (Q2957917) (← links)
- A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata (Q3526417) (← links)
- (Q3976051) (← links)
- (Q4993768) (← links)
- Distance desert automata and the star height problem (Q5313718) (← links)