Kosaburo Hashiguchi

Publication Activity (10 Years)

Years Active: 1976-2004
Publications (10 Years): 0

Publications

Kosaburo Hashiguchi, Naoto Sakakibara, Shuji Jimbo
Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids. Theor. Comput. Sci. 312 (2-3) (2004)
Kosaburo Hashiguchi, Yoshito Wada, Shuji Jimbo
Regular binoid expressions and regular binoid languages. Theor. Comput. Sci. 304 (1-3) (2003)
Kosaburo Hashiguchi
Erratum to "New upper bounds to the limitedness of distance automata". Theor. Comput. Sci. 290 (3) (2003)
Kosaburo Hashiguchi, Takahiro Kunai, Shuji Jimbo
Finite Codes over Free Binoids. J. Autom. Lang. Comb. 7 (4) (2002)
Kosaburo Hashiguchi, Kenichi Ishiguro, Shuji Jimbo
Decidability of The Equivalence Problem for Finitely Ambiguous Finance Automata. Int. J. Algebra Comput. 12 (3) (2002)
Kosaburo Hashiguchi
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. Theor. Comput. Sci. 289 (1) (2002)
Kosaburo Hashiguchi, Takahiro Kunai, Shuji Jimbo
Finite Codes over Free Binoids. DCFS (2001)
Kosaburo Hashiguchi, Shin Ichihara, Shuji Jimbo
Formal Languages over Free Binoids. J. Autom. Lang. Comb. 5 (3) (2000)
Kosaburo Hashiguchi
New upper bounds to the limitedness of distance automata. Theor. Comput. Sci. 233 (1-2) (2000)
Kosaburo Hashiguchi
New Upper Bounds to the Limitedness of Distance Automata. ICALP (1996)
Kosaburo Hashiguchi
The Infinite 2-Star Height Hierarchy of Extended Regular Languages of Star Degree at Most Two Inf. Comput. 114 (2) (1994)
Kosaburo Hashiguchi, Kazuya Yamada
String Matching Problems over Free Partially Commutative Monoids Inf. Comput. 101 (2) (1992)
Kosaburo Hashiguchi
The double reconstruction conjecture about finite colored hypergraphs. J. Comb. Theory, Ser. B 54 (1) (1992)
Kosaburo Hashiguchi, Kazuya Yamada
Two Recognizable String-Matching Problems Over Free Partially Commutative Monoids. Theor. Comput. Sci. 92 (1) (1992)
Kosaburo Hashiguchi
The Double Reconstruction Conjectures about Colored Hypergraphs and Colored Directed Graphs. LATIN (1992)
Heekeun Yoo, Kosaburo Hashiguchi
Extended Regular Expressions of Arbitrary Star Degrees. Theor. Comput. Sci. 97 (2) (1992)
Kosaburo Hashiguchi
Recognizable Closures and Submonoids of Free Partially Commutative Monoids. Theor. Comput. Sci. 86 (2) (1991)
Kosaburo Hashiguchi
Algorithms for Determining Relative Inclusion Star Height and Inclusion Star Height. Theor. Comput. Sci. 91 (1) (1991)
Kosaburo Hashiguchi
Algorithms for Determining the Smallest Number of Nonterminals (States) Sufficient for Generating (Accepting) a Regular Language. ICALP (1991)
H. Yoo, Kosaburo Hashiguchi
Extended Automata-Like Regular Expressions of Star Degree At Most (2, 1). Theor. Comput. Sci. 88 (2) (1991)
Kosaburo Hashiguchi
Improved Limitedness Theorems on Finite Automata with Distance Functions. Theor. Comput. Sci. 72 (1) (1990)
Kosaburo Hashiguchi, H. Yoo
Extended Regular Expressions of Star Degree at Most Two. Theor. Comput. Sci. 76 (2-3) (1990)
Kosaburo Hashiguchi
Algorithms for Determining Relative Star height and Star Height. IFIP Congress (1989)
Kosaburo Hashiguchi
Notes on Congruence Relations and Factor Pumping Conditions for Rational Languages. Theor. Comput. Sci. 57 (1988)
Kosaburo Hashiguchi
Algorithms for Determining Relative Star Height and Star Height Inf. Comput. 78 (2) (1988)
Kosaburo Hashiguchi
Relative star height, star height and finite automata with distance functions. Formal Properties of Finite Automata and Applications (1988)
Kosaburo Hashiguchi
Notes on Finitely Generated Semigroups and Pumping Conditions for Regular Languages. Theor. Comput. Sci. 46 (3) (1986)
Kosaburo Hashiguchi
Representation Theorems on Regular Languages. J. Comput. Syst. Sci. 27 (1) (1983)
Kosaburo Hashiguchi
Limitedness Theorem on Finite Automata with Distance Functions. J. Comput. Syst. Sci. 24 (2) (1982)
Kosaburo Hashiguchi
Regular Languages of Star Height One Inf. Control. 53 (3) (1982)
Kosaburo Hashiguchi, Namio Honda
The Star Height of Reset-Free Events and Strictly Locally Testable Events Inf. Control. 40 (3) (1979)
Kosaburo Hashiguchi
A Decision Procedure for the Order of Regular Events. Theor. Comput. Sci. 8 (1979)
Kosaburo Hashiguchi, Namio Honda
Homomorphisms That Preserve Star Height Inf. Control. 30 (3) (1976)
Kosaburo Hashiguchi, Namio Honda
Properties of Code Events and Homomorphisms over Regular Events. J. Comput. Syst. Sci. 12 (3) (1976)