K
Kosaburo Hashiguchi
Researcher at Toyohashi University of Technology
Publications - 25
Citations - 726
Kosaburo Hashiguchi is an academic researcher from Toyohashi University of Technology. The author has contributed to research in topics: Star height & Regular language. The author has an hindex of 11, co-authored 25 publications receiving 708 citations. Previous affiliations of Kosaburo Hashiguchi include Tohoku University.
Papers
More filters
Journal ArticleDOI
Limitedness theorem on finite automata with distance functions
TL;DR: There exists an algorithm for deciding whether or not an arbitrary finite automaton with a distance function is limited in distance, and it is shown that this paper shows that this algorithm is available.
Proceedings Article
Algorithms for Determining Relative Star height and Star Height.
TL;DR: Hashiguchi and Honda as discussed by the authors showed that for any regular language, there are infinitely many regular expressions denoting this language, and they used the limitedness theorem on finite automata with distance functions (in short, D-automata) in Hashiguci (1982A, 1983).
Journal ArticleDOI
Algorithms for determining relative star height and star height
TL;DR: Eggan(l963) introduced the notion of the star height to each regular expression which is a nonnegative integer denoting the nestedness of star operators in this expression.
Journal ArticleDOI
Improved limitedness theorems on finite automata with distance functions
TL;DR: An improved upper bound of ID ( A) when the upper limit of ID( A ) is finite is presented, and one necessary and sufficient condition concerning (word,+)-expressions is presented for theupper limit ofID( A) to be infinite.
Journal ArticleDOI
Representation theorems on regular languages
TL;DR: It is shown that there exist algorithms for deciding whether or not an arbitrary regular language has a Ω-representation over an arbitrary class C of regular languages for any subset Ω of T.