The limitedness problem on distance automata: Hashiguchi's method revisited
From MaRDI portal
Publication:1884970
DOI10.1016/S0304-3975(03)00377-3zbMath1071.68045MaRDI QIDQ1884970
Viktor A. Podolskiy, Hing-Man Leung
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (15)
DETERMINATIONS OF WEIGHTED FINITE AUTOMATA OVER COMMUTATIVE IDEMPOTENT MF-SEMIRINGS ⋮ Approximate comparison of functions computed by distance automata ⋮ Distance desert automata and the star height problem ⋮ Bounded repairability of word languages ⋮ Closure properties and complexity of rational sets of regular languages ⋮ Existential and universal width of alternating finite automata ⋮ A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata ⋮ Unnamed Item ⋮ Descriptional Complexity of Error Detection ⋮ Minimal Union-Free Decompositions of Regular Languages ⋮ The View Selection Problem for Regular Path Queries ⋮ What's decidable about weighted automata? ⋮ MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES ⋮ The factorisation forest theorem ⋮ SOME DECISION QUESTIONS CONCERNING THE TIME COMPLEXITY OF LANGUAGE ACCEPTORS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- New upper bounds to the limitedness of distance automata
- Regular languages of star height one
- On semigroups of matrices over the tropical semiring
This page was built for publication: The limitedness problem on distance automata: Hashiguchi's method revisited
