Kosaburo Hashiguchi

643 total citations
26 papers, 320 citations indexed

About

Kosaburo Hashiguchi is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Molecular Biology. According to data from OpenAlex, Kosaburo Hashiguchi has authored 26 papers receiving a total of 320 indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Computational Theory and Mathematics, 19 papers in Artificial Intelligence and 7 papers in Molecular Biology. Recurrent topics in Kosaburo Hashiguchi's work include semigroups and automata theory (23 papers), Advanced Algebra and Logic (15 papers) and Logic, programming, and type systems (6 papers). Kosaburo Hashiguchi is often cited by papers focused on semigroups and automata theory (23 papers), Advanced Algebra and Logic (15 papers) and Logic, programming, and type systems (6 papers). Kosaburo Hashiguchi collaborates with scholars based in Japan. Kosaburo Hashiguchi's co-authors include Shin Ichihara, Yoshito Wada, Kazuya Yamada and Kenji Hashimoto and has published in prestigious journals such as Theoretical Computer Science, Journal of Computer and System Sciences and Journal of Combinatorial Theory Series B.

In The Last Decade

Kosaburo Hashiguchi

26 papers receiving 294 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Kosaburo Hashiguchi Japan 10 291 222 88 30 24 26 320
Stefano Varricchio Italy 10 334 1.1× 259 1.2× 73 0.8× 22 0.7× 35 1.5× 46 387
Jean-Marc Champarnaud France 10 228 0.8× 196 0.9× 96 1.1× 18 0.6× 7 0.3× 44 262
John Doner United States 5 217 0.7× 195 0.9× 29 0.3× 37 1.2× 13 0.5× 8 277
Michel Latteux France 9 283 1.0× 199 0.9× 132 1.5× 11 0.4× 13 0.5× 54 307
A. Ehrenfeucht United States 7 154 0.5× 172 0.8× 47 0.5× 13 0.4× 6 0.3× 19 241
Luc Boasson France 12 469 1.6× 360 1.6× 154 1.8× 20 0.7× 38 1.6× 46 526
Jacques Loeckx Germany 7 257 0.9× 261 1.2× 32 0.4× 41 1.4× 9 0.4× 18 346
H. J. Shyr Taiwan 11 395 1.4× 308 1.4× 235 2.7× 9 0.3× 15 0.6× 45 453
Dietrich Kuske Germany 10 241 0.8× 135 0.6× 30 0.3× 21 0.7× 71 3.0× 59 275
S. V. Avgustinovich Russia 10 97 0.3× 160 0.7× 32 0.4× 37 1.2× 17 0.7× 39 219

Countries citing papers authored by Kosaburo Hashiguchi

Since Specialization
Citations

This map shows the geographic impact of Kosaburo Hashiguchi's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Kosaburo Hashiguchi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Kosaburo Hashiguchi more than expected).

Fields of papers citing papers by Kosaburo Hashiguchi

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Kosaburo Hashiguchi. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Kosaburo Hashiguchi. The network helps show where Kosaburo Hashiguchi may publish in the future.

Co-authorship network of co-authors of Kosaburo Hashiguchi

This figure shows the co-authorship network connecting the top 25 collaborators of Kosaburo Hashiguchi. A scholar is included among the top collaborators of Kosaburo Hashiguchi based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Kosaburo Hashiguchi. Kosaburo Hashiguchi is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Hashiguchi, Kosaburo, et al.. (2003). Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids. Theoretical Computer Science. 312(2-3). 251–266. 4 indexed citations
2.
Hashiguchi, Kosaburo, et al.. (2003). MODIFIED RSA CRYPTOSYSTEMS OVER BICODES. 377–389. 1 indexed citations
3.
Hashiguchi, Kosaburo, et al.. (2002). DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA. International Journal of Algebra and Computation. 12(3). 445–461. 16 indexed citations
4.
Hashiguchi, Kosaburo, et al.. (2000). Formal Languages over Free Binoids. Journal of automata, languages and combinatorics. 5(3). 219–234. 15 indexed citations
5.
Hashiguchi, Kosaburo. (1994). The Infinite 2-Star Height Hierarchy of Extended Regular Languages of Star Degree at Most Two. Information and Computation. 114(2). 237–246. 1 indexed citations
6.
Hashiguchi, Kosaburo & Kazuya Yamada. (1992). Two recognizable string-matching problems over free partially commutative monoids. Theoretical Computer Science. 92(1). 77–86. 1 indexed citations
7.
Hashiguchi, Kosaburo. (1992). The double reconstruction conjecture about finite colored hypergraphs. Journal of Combinatorial Theory Series B. 54(1). 64–76. 2 indexed citations
8.
Hashiguchi, Kosaburo, et al.. (1991). Extended automata-like regular expressions of star degree at most (2, 1). Theoretical Computer Science. 88(2). 351–363. 1 indexed citations
9.
Hashiguchi, Kosaburo. (1991). Recognizable closures and submonoids of free partially commutative monoids. Theoretical Computer Science. 86(2). 233–241. 10 indexed citations
10.
Hashiguchi, Kosaburo. (1991). Algorithms for determining relative inclusion star height and inclusion star height. Theoretical Computer Science. 91(1). 85–100. 5 indexed citations
11.
Hashiguchi, Kosaburo. (1990). Improved limitedness theorems on finite automata with distance functions. Theoretical Computer Science. 72(1). 27–38. 32 indexed citations
12.
Hashiguchi, Kosaburo, et al.. (1990). Extended regular expressions of star degree at most two. Theoretical Computer Science. 76(2-3). 273–284. 4 indexed citations
13.
Hashiguchi, Kosaburo. (1986). Notes on finitely generated semigroups and pumping conditions for regular languages. Theoretical Computer Science. 46. 53–66. 4 indexed citations
14.
Hashiguchi, Kosaburo. (1983). Representation theorems on regular languages. Journal of Computer and System Sciences. 27(1). 101–115. 28 indexed citations
15.
Hashiguchi, Kosaburo. (1982). Regular languages of star height one. Information and Control. 53(3). 199–210. 19 indexed citations
16.
Hashiguchi, Kosaburo. (1982). Limitedness theorem on finite automata with distance functions. Journal of Computer and System Sciences. 24(2). 233–244. 64 indexed citations
17.
Hashiguchi, Kosaburo, et al.. (1979). The star height of reset-free events and strictly locally testable events. Information and Control. 40(3). 267–284. 6 indexed citations
18.
Hashiguchi, Kosaburo. (1979). A decision procedure for the order of regular events. Theoretical Computer Science. 8(1). 69–72. 24 indexed citations
19.
Hashiguchi, Kosaburo, et al.. (1976). Homomorphisms that preserve star height. Information and Control. 30(3). 247–266. 6 indexed citations
20.
Hashiguchi, Kosaburo, et al.. (1976). Properties of code events and homomorphisms over regular events. Journal of Computer and System Sciences. 12(3). 352–367. 5 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026