Properties of Code Events and Homomorphisms over Regular Events. - Kosaburo Hashiguchi; Namio Honda (J. Comput. Syst. Sci., 1976)

Homomorphisms That Preserve Star Height - Kosaburo Hashiguchi; Namio Honda (Inf. Control., 1976)

A Decision Procedure for the Order of Regular Events. - Kosaburo Hashiguchi (Theor. Comput. Sci., 1979)

The Star Height of Reset-Free Events and Strictly Locally Testable Events - Kosaburo Hashiguchi; Namio Honda (Inf. Control., 1979)

Limitedness Theorem on Finite Automata with Distance Functions. - Kosaburo Hashiguchi (J. Comput. Syst. Sci., 1982)

Regular Languages of Star Height One - Kosaburo Hashiguchi (Inf. Control., 1982)

Representation Theorems on Regular Languages. - Kosaburo Hashiguchi (J. Comput. Syst. Sci., 1983)

Notes on Finitely Generated Semigroups and Pumping Conditions for Regular Languages. - Kosaburo Hashiguchi (Theor. Comput. Sci., 1986)

Relative star height, star height and finite automata with distance functions. - Kosaburo Hashiguchi (Formal Properties of Finite Automata and Applications, 1988)

Notes on Congruence Relations and Factor Pumping Conditions for Rational Languages. - Kosaburo Hashiguchi (Theor. Comput. Sci., 1988)

Algorithms for Determining Relative Star Height and Star Height - Kosaburo Hashiguchi (Inf. Comput., 1988)

Improved Limitedness Theorems on Finite Automata with Distance Functions. - Kosaburo Hashiguchi (Theor. Comput. Sci., 1990)

Extended Regular Expressions of Star Degree at Most Two. - Kosaburo Hashiguchi; H. Yoo (Theor. Comput. Sci., 1990)

Algorithms for Determining the Smallest Number of Nonterminals (States) Sufficient for Generating (Accepting) a Regular Language. - Kosaburo Hashiguchi (ICALP, 1991)

Recognizable Closures and Submonoids of Free Partially Commutative Monoids. - Kosaburo Hashiguchi (Theor. Comput. Sci., 1991)

Algorithms for Determining Relative Inclusion Star Height and Inclusion Star Height. - Kosaburo Hashiguchi (Theor. Comput. Sci., 1991)

Extended Automata-Like Regular Expressions of Star Degree At Most (2, 1). - H. Yoo; Kosaburo Hashiguchi (Theor. Comput. Sci., 1991)

The Double Reconstruction Conjectures about Colored Hypergraphs and Colored Directed Graphs. - Kosaburo Hashiguchi (LATIN, 1992)

The double reconstruction conjecture about finite colored hypergraphs. - Kosaburo Hashiguchi (J. Comb. Theory B, 1992)

Two Recognizable String-Matching Problems Over Free Partially Commutative Monoids. - Kosaburo Hashiguchi; Kazuya Yamada (Theor. Comput. Sci., 1992)

Extended Regular Expressions of Arbitrary Star Degrees. - Heekeun Yoo; Kosaburo Hashiguchi (Theor. Comput. Sci., 1992)

String Matching Problems over Free Partially Commutative Monoids - Kosaburo Hashiguchi; Kazuya Yamada (Inf. Comput., 1992)

The Infinite 2-Star Height Hierarchy of Extended Regular Languages of Star Degree at Most Two - Kosaburo Hashiguchi (Inf. Comput., 1994)

Formal Languages over Free Binoids. - Kosaburo Hashiguchi; Shin Ichihara; Shuji Jimbo (J. Autom. Lang. Comb., 2000)

New upper bounds to the limitedness of distance automata. - Kosaburo Hashiguchi (Theor. Comput. Sci., 2000)

Decidability of The Equivalence Problem for Finitely Ambiguous Finance Automata. - Kosaburo Hashiguchi; Kenichi Ishiguro; Shuji Jimbo (Int. J. Algebra Comput., 2002)

Finite Codes over Free Binoids. - Kosaburo Hashiguchi; Takahiro Kunai; Shuji Jimbo (J. Autom. Lang. Comb., 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., 2002)

Erratum to "New upper bounds to the limitedness of distance automata". - Kosaburo Hashiguchi (Theor. Comput. Sci., 2003)

Regular binoid expressions and regular binoid languages. - Kosaburo Hashiguchi; Yoshito Wada; Shuji Jimbo (Theor. Comput. Sci., 2003)

Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids. - Kosaburo Hashiguchi; Naoto Sakakibara; Shuji Jimbo (Theor. Comput. Sci., 2004)