Algorithms for determining relative star height and star height
Information and Computation
Improved limitedness theorems on finite automata with distance functions
Theoretical Computer Science - Special issue on theoretical computer science, algebra and combinatorics
Factorization forests of finite height
Theoretical Computer Science - Special issue on theoretical computer science, algebra and combinatorics
Limitedness theorem on finite automata with distance functions: an algebraic proof
Theoretical Computer Science
New upper bounds to the limitedness of distance automata
Theoretical Computer Science
Recognizable Sets with Multiplicities in the Tropical Semiring
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
Minimal Union-Free Decompositions of Regular Languages
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Boundedness of Monadic Second-Order Formulae over Finite Words
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
The Theory of Stabilisation Monoids and Regular Cost Functions
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
The view selection problem for regular path queries
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Membership and finiteness problems for rational sets of regular languages
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Bounded repairability of word languages
Journal of Computer and System Sciences
| Hi-index | 5.24 |
Hashiguchi has studied the limitedness problem of distance automata (DA) in a series of paper [(J. Comput. System Sci. 24 (1982) 233; Theoret. Comput. Sci. 72 (1990) 27; Theoret. Comput. Sci. 233 (2000) 19)]. The distance of a DA can be limited or unbounded. Given that the distance of a DA is limited, Hashiguchi has proved in Hashiguchi (2000) that the distance of the automaton is bounded by 24n3+n lg(n+2)+n, where n is the number of states. In this paper, we study again Hashiguchi's solution to the limitedness problem. We have made a number of simplification and improvement on Hashiguchi's method. We are able to improve the upper bound to 23n3+n lg n+n-1.