Improved limitedness theorems on finite automata with distance functions

From MaRDI portal
Revision as of 16:51, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:908702

DOI10.1016/0304-3975(90)90044-IzbMath0693.68031OpenAlexW2046829789MaRDI QIDQ908702

Kosaburo Hashiguchi

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(90)90044-i




Related Items (29)

Two techniques in the area of the star problem in trace monoidsThe limitedness problem on distance automata: Hashiguchi's method revisitedMethods and applications of (max,+) linear algebraFinite-valued distance automataExponential upper and lower bounds for the order of a regular languageTrading Bounds for Memory in Games with CountersDistance desert automata and the star height problemOn the Burnside problem for semigroups of matrices in the \((\max,+)\) algebraOn finite automata with limited nondeterminism (extended abstract)Bounded repairability of word languagesDistance automata having large finite distance or finite ambiguityA Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-AutomataInclines and incline matrices: A survey.R-AutomataThe product of rational languagesOn semigroups of matrices over the tropical semiringAlgorithms for determining relative inclusion star height and inclusion star heightUniversality of R-automata with Value CopyingRegular path queries under approximate semanticsBounded regular path queries in view-based data integrationThe closure under division and a characterization of the recognizable $\mathcal {Z}$-subsetsREACHABILITY PROBLEMS FOR PRODUCTS OF MATRICES IN SEMIRINGSWeighted automataNew upper bounds to the limitedness of distance automataThe finite power problem revisited.Limitedness theorem on finite automata with distance functions: An algebraic proofDistances between languages and reflexivity of relationsThe finite power property in free groupsSome properties of recognizable \(\mathcal Z\)-subsets




Cites Work




This page was built for publication: Improved limitedness theorems on finite automata with distance functions