New upper bounds to the limitedness of distance automata
From MaRDI portal
Publication:1575957
DOI10.1016/S0304-3975(97)00260-0zbMath0952.68082WikidataQ127374552 ScholiaQ127374552MaRDI QIDQ1575957
Publication date: 23 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (6)
The limitedness problem on distance automata: Hashiguchi's method revisited ⋮ Distance desert automata and the star height problem ⋮ A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata ⋮ Regular path queries under approximate semantics ⋮ Bounded regular path queries in view-based data integration ⋮ What's decidable about weighted automata?
Cites Work
- Limitedness theorem on finite automata with distance functions: An algebraic proof
- Improved limitedness theorems on finite automata with distance functions
- Factorization forests of finite height
- Limitedness theorem on finite automata with distance functions
- Representation theorems on regular languages
- On the topological structure of a finitely generated semigroup of matrices
- Algorithms for determining relative star height and star height
- A decision procedure for the order of regular events
- Algorithms for determining relative inclusion star height and inclusion star height
- Regular languages of star height one
- Distance automata having large finite distance or finite ambiguity
- Finite automata having cost functions: Nondeterministic models
- On semigroups of matrices over the tropical semiring
This page was built for publication: New upper bounds to the limitedness of distance automata
