Demo Data from SIGIR 2026 / reviewers in the wild / expert
Kosaburo Hashiguchi
dblp:98/6078
· DBLP profile ↗
27ranked-venue papers
25as first author
0since 2021 · last 2004
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 27 · 25 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
8 papers |
Automata and formal languages · 66% Algorithms and data structures · 18% Coding theory · 17% |
Topics — the 11 heaviest of 12, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Automata and formal languages
regular languages |
0.0 | 5 | 1991 | Algorithms for Determining the Smallest Number of Nonterminals (States) Sufficient for Generating (Accepting) a Regular Language · ICALP 1991 Algorithms for Determining Relative Star Height and Star Height · Inf. Comput. 1988 Regular Languages of Star Height One · Inf. Control. 1982 |
Automata and formal languages › petri nets
boundedness problem |
0.0 | 1 | 1996 | New Upper Bounds to the Limitedness of Distance Automata · ICALP 1996 |
Coding theory
upper bounds |
0.0 | 1 | 1996 | New Upper Bounds to the Limitedness of Distance Automata · ICALP 1996 |
Algorithms and data structures › sequence algorithms
string algorithms |
0.0 | 2 | 1992 | String Matching Problems over Free Partially Commutative Monoids · Inf. Comput. 1992 Algorithms for Determining Relative Star Height and Star Height · Inf. Comput. 1988 |
Automata and formal languages › regular languages
star height |
0.0 | 4 | 1988 | Algorithms for Determining Relative Star Height and Star Height · Inf. Comput. 1988 Regular Languages of Star Height One · Inf. Control. 1982 The Star Height of Reset-Free Events and Strictly Locally Testable Events · Inf. Control. 1979 |
Algorithms and data structures › sequence algorithms › string algorithms
string matching |
0.0 | 1 | 1992 | String Matching Problems over Free Partially Commutative Monoids · Inf. Comput. 1992 |
Automata and formal languages
finite automata |
0.0 | 1 | 1991 | Algorithms for Determining the Smallest Number of Nonterminals (States) Sufficient for Generating (Accepting) a Regular Language · ICALP 1991 |
Automata and formal languages › descriptional complexity
state complexity |
0.0 | 1 | 1991 | Algorithms for Determining the Smallest Number of Nonterminals (States) Sufficient for Generating (Accepting) a Regular Language · ICALP 1991 |
Coding theory › error-correcting codes › block codes › linear code
parity-check matrix |
0.0 | 1 | 1992 | String Matching Problems over Free Partially Commutative Monoids · Inf. Comput. 1992 |
Automata and formal languages
automata algorithms |
0.0 | 1 | 1988 | Algorithms for Determining Relative Star Height and Star Height · Inf. Comput. 1988 |
Automata and formal languages › formal language operations
morphisms |
0.0 | 1 | 1976 | Homomorphisms That Preserve Star Height · Inf. Control. 1976 |
Methods — techniques the papers use, named apart from their topics
automata theory · 0.0combinatorial methods · 0.0combinatorial algorithms · 0.0algorithm design · 0.0algebraic methods · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2004 | Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids
Kosaburo Hashiguchi, Naoto Sakakibara, Shuji Jimbo |
Theor. Comput. Sci. | 1 |
| 2003 | Erratum to "New upper bounds to the limitedness of distance automata"
Kosaburo Hashiguchi |
Theor. Comput. Sci. | 1 |
| 2003 | Regular binoid expressions and regular binoid languages
Kosaburo Hashiguchi, Yoshito Wada, Shuji Jimbo |
Theor. Comput. Sci. | 1 |
| 2002 | Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language R with R1RR2 for given regular languages R1, R2
Kosaburo Hashiguchi |
Theor. Comput. Sci. | 1 |
| 2000 | New upper bounds to the limitedness of distance automata
Kosaburo Hashiguchi |
Theor. Comput. Sci. | 1 |
| 1996 | New Upper Bounds to the Limitedness of Distance Automata
Kosaburo Hashiguchi |
ICALP | 1 |
| 1994 | The Infinite 2-Star Height Hierarchy of Extended Regular Languages of Star Degree at Most Two
Kosaburo Hashiguchi |
Inf. Comput. | 1 |
| 1992 | The Double Reconstruction Conjectures about Colored Hypergraphs and Colored Directed Graphs
Kosaburo Hashiguchi |
LATIN | 1 |
| 1992 | String Matching Problems over Free Partially Commutative Monoids
Kosaburo Hashiguchi, Kazuya Yamada |
Inf. Comput. | 1 |
| 1992 | Two Recognizable String-Matching Problems Over Free Partially Commutative Monoids
Kosaburo Hashiguchi, Kazuya Yamada |
Theor. Comput. Sci. | 1 |
| 1992 | Extended Regular Expressions of Arbitrary Star Degrees
Heekeun Yoo, Kosaburo Hashiguchi |
Theor. Comput. Sci. | 2 |
| 1991 | Algorithms for Determining the Smallest Number of Nonterminals (States) Sufficient for Generating (Accepting) a Regular Language
Kosaburo Hashiguchi |
ICALP | 1 |
| 1991 | Recognizable Closures and Submonoids of Free Partially Commutative Monoids
Kosaburo Hashiguchi |
Theor. Comput. Sci. | 1 |
| 1991 | Algorithms for Determining Relative Inclusion Star Height and Inclusion Star Height
Kosaburo Hashiguchi |
Theor. Comput. Sci. | 1 |
| 1991 | Extended Automata-Like Regular Expressions of Star Degree At Most (2, 1)
H. Yoo, Kosaburo Hashiguchi |
Theor. Comput. Sci. | 2 |
| 1990 | Improved Limitedness Theorems on Finite Automata with Distance Functions
Kosaburo Hashiguchi |
Theor. Comput. Sci. | 1 |
| 1990 | Extended Regular Expressions of Star Degree at Most Two
Kosaburo Hashiguchi, H. Yoo |
Theor. Comput. Sci. | 1 |
| 1988 | Algorithms for Determining Relative Star Height and Star Height
Kosaburo Hashiguchi |
Inf. Comput. | 1 |
| 1988 | Notes on Congruence Relations and Factor Pumping Conditions for Rational Languages
Kosaburo Hashiguchi |
Theor. Comput. Sci. | 1 |
| 1986 | Notes on Finitely Generated Semigroups and Pumping Conditions for Regular Languages
Kosaburo Hashiguchi |
Theor. Comput. Sci. | 1 |
| 1983 | Representation Theorems on Regular Languages
Kosaburo Hashiguchi |
J. Comput. Syst. Sci. | 1 |
| 1982 | Regular Languages of Star Height One
Kosaburo Hashiguchi |
Inf. Control. | 1 |
| 1982 | Limitedness Theorem on Finite Automata with Distance Functions
Kosaburo Hashiguchi |
J. Comput. Syst. Sci. | 1 |
| 1979 | The Star Height of Reset-Free Events and Strictly Locally Testable Events
Kosaburo Hashiguchi, Namio Honda |
Inf. Control. | 1 |
| 1979 | A Decision Procedure for the Order of Regular Events
Kosaburo Hashiguchi |
Theor. Comput. Sci. | 1 |
| 1976 | Homomorphisms That Preserve Star Height
Kosaburo Hashiguchi, Namio Honda |
Inf. Control. | 1 |
| 1976 | Properties of Code Events and Homomorphisms over Regular Events
Kosaburo Hashiguchi, Namio Honda |
J. Comput. Syst. Sci. | 1 |