Pages that link to "Item:Q807031"
From MaRDI portal
The following pages link to Limitedness theorem on finite automata with distance functions: An algebraic proof (Q807031):
Displaying 18 items.
- Bounded regular path queries in view-based data integration (Q989472) (← links)
- Finite-valued distance automata (Q1341750) (← links)
- New upper bounds to the limitedness of distance automata (Q1575957) (← links)
- Some properties of recognizable \(\mathcal Z\)-subsets (Q1870588) (← links)
- The limitedness problem on distance automata: Hashiguchi's method revisited (Q1884970) (← links)
- The factorisation forest theorem (Q2074219) (← links)
- Regular path queries under approximate semantics (Q2502162) (← links)
- Trading Bounds for Memory in Games with Counters (Q3449476) (← links)
- A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata (Q3526417) (← links)
- R-Automata (Q3541011) (← links)
- Distance automata having large finite distance or finite ambiguity (Q4032930) (← links)
- The closure under division and a characterization of the recognizable $\mathcal {Z}$-subsets (Q4717041) (← links)
- Methods and applications of (max,+) linear algebra (Q5048930) (← links)
- (Q5091266) (← links)
- On finite automata with limited nondeterminism (extended abstract) (Q5096848) (← links)
- Universality of R-automata with Value Copying (Q5179055) (← links)
- Distance desert automata and the star height problem (Q5313718) (← links)
- REACHABILITY PROBLEMS FOR PRODUCTS OF MATRICES IN SEMIRINGS (Q5483458) (← links)
