Limitedness theorem on finite automata with distance functions: An algebraic proof
From MaRDI portal
Publication:807031
DOI10.1016/0304-3975(91)90321-RzbMATH Open0729.68049MaRDI QIDQ807031FDOQ807031
Publication date: 1991
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- On the computational power of pushdown automata
- Limitedness theorem on finite automata with distance functions
- On the topological structure of a finitely generated semigroup of matrices
- Representation theorems on regular languages
- Improved limitedness theorems on finite automata with distance functions
- On measuring nondeterminism in regular languages
- Multitape one-way nonwriting automata
- On the decidability of some problems about rational subsets of free partially commutative monoids
- Regular languages of star height one
Cited In (21)
- Trading Bounds for Memory in Games with Counters
- Improved limitedness theorems on finite automata with distance functions
- A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
- Some properties of recognizable \(\mathcal Z\)-subsets
- Methods and applications of (max,+) linear algebra
- The factorisation forest theorem
- Distance desert automata and the star height problem
- Finite-valued distance automata
- REACHABILITY PROBLEMS FOR PRODUCTS OF MATRICES IN SEMIRINGS
- Regular path queries under approximate semantics
- On finite automata with limited nondeterminism (extended abstract)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The limitedness problem on distance automata: Hashiguchi's method revisited
- The closure under division and a characterization of the recognizable $\mathcal {Z}$-subsets
- Universality of R-automata with Value Copying
- Existential and universal width of alternating finite automata
- Bounded regular path queries in view-based data integration
- R-Automata
- New upper bounds to the limitedness of distance automata
- Distance automata having large finite distance or finite ambiguity
This page was built for publication: Limitedness theorem on finite automata with distance functions: An algebraic proof
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q807031)
