| 2004 |
|---|
| 33 | EE | 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): 251-266 (2004) |
| 2003 |
|---|
| 32 | EE | Kosaburo Hashiguchi,
Yoshito Wada,
Shuji Jimbo:
Regular binoid expressions and regular binoid languages.
Theor. Comput. Sci. 1-3(304): 291-313 (2003) |
| 31 | | Kosaburo Hashiguchi:
Erratum to "New upper bounds to the limitedness of distance automata".
Theor. Comput. Sci. 290(3): 2183 (2003) |
| 2002 |
|---|
| 30 | EE | Kosaburo Hashiguchi,
Kenichi Ishiguro,
Shuji Jimbo:
Decidability of The Equivalence Problem for Finitely Ambiguous Finance Automata.
IJAC 12(3): 445 (2002) |
| 29 | | Kosaburo Hashiguchi,
Takahiro Kunai,
Shuji Jimbo:
Finite Codes over Free Binoids.
Journal of Automata, Languages and Combinatorics 7(4): 505-518 (2002) |
| 28 | | 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): 853-859 (2002) |
| 2000 |
|---|
| 27 | | Kosaburo Hashiguchi,
Shin Ichihara,
Shuji Jimbo:
Formal Languages over Free Bionoids.
Journal of Automata, Languages and Combinatorics 5(3): 219-234 (2000) |
| 26 | EE | Kosaburo Hashiguchi:
New upper bounds to the limitedness of distance automata.
Theor. Comput. Sci. 233(1-2): 19-32 (2000) |
| 1996 |
|---|
| 25 | | Kosaburo Hashiguchi:
New Upper Bounds to the Limitedness of Distance Automata.
ICALP 1996: 324-335 |
| 1994 |
|---|
| 24 | | Kosaburo Hashiguchi:
The Infinite 2-Star Height Hierarchy of Extended Regular Languages of Star Degree at Most Two
Inf. Comput. 114(2): 237-246 (1994) |
| 1992 |
|---|
| 23 | | Kosaburo Hashiguchi:
The Double Reconstruction Conjectures about Colored Hypergraphs and Colored Directed Graphs.
LATIN 1992: 246-261 |
| 22 | | Kosaburo Hashiguchi,
Kazuya Yamada:
String Matching Problems over Free Partially Commutative Monoids
Inf. Comput. 101(2): 131-149 (1992) |
| 21 | EE | Kosaburo Hashiguchi:
The double reconstruction conjecture about finite colored hypergraphs.
J. Comb. Theory, Ser. B 54(1): 64-76 (1992) |
| 20 | | Kosaburo Hashiguchi,
Kazuya Yamada:
Two Recognizable String-Matching Problems Over Free Partially Commutative Monoids.
Theor. Comput. Sci. 92(1): 77-86 (1992) |
| 19 | | Heekeun Yoo,
Kosaburo Hashiguchi:
Extended Regular Expressions of Arbitrary Star Degrees.
Theor. Comput. Sci. 97(2): 217-231 (1992) |
| 1991 |
|---|
| 18 | | Kosaburo Hashiguchi:
Algorithms for Determining the Smallest Number of Nonterminals (States) Sufficient for Generating (Accepting) a Regular Language.
ICALP 1991: 641-648 |
| 17 | | Kosaburo Hashiguchi:
Recognizable Closures and Submonoids of Free Partially Commutative Monoids.
Theor. Comput. Sci. 86(2): 233-241 (1991) |
| 16 | | H. Yoo,
Kosaburo Hashiguchi:
Extended Automata-Like Regular Expressions of Star Degree At Most (2, 1).
Theor. Comput. Sci. 88(2): 351-363 (1991) |
| 15 | | Kosaburo Hashiguchi:
Algorithms for Determining Relative Inclusion Star Height and Inclusion Star Height.
Theor. Comput. Sci. 91(1): 85-100 (1991) |
| 1990 |
|---|
| 14 | | Kosaburo Hashiguchi:
Improved Limitedness Theorems on Finite Automata with Distance Functions.
Theor. Comput. Sci. 72(1): 27-38 (1990) |
| 13 | | Kosaburo Hashiguchi,
H. Yoo:
Extended Regular Expressions of Star Degree at Most Two.
Theor. Comput. Sci. 76(2-3): 273-284 (1990) |
| 1989 |
|---|
| 12 | | Kosaburo Hashiguchi:
Algorithms for Determining Relative Star height and Star Height.
IFIP Congress 1989: 5-10 |
| 1988 |
|---|
| 11 | | Kosaburo Hashiguchi:
Relative star height, star height and finite automata with distance functions.
Formal Properties of Finite Automata and Applications 1988: 74-88 |
| 10 | | Kosaburo Hashiguchi:
Algorithms for Determining Relative Star Height and Star Height
Inf. Comput. 78(2): 124-169 (1988) |
| 9 | | Kosaburo Hashiguchi:
Notes on Congruence Relations and Factor Pumping Conditions for Rational Languages.
Theor. Comput. Sci. 57: 303-316 (1988) |
| 1986 |
|---|
| 8 | | Kosaburo Hashiguchi:
Notes on Finitely Generated Semigroups and Pumping Conditions for Regular Languages.
Theor. Comput. Sci. 46(3): 53-66 (1986) |
| 1983 |
|---|
| 7 | | Kosaburo Hashiguchi:
Representation Theorems on Regular Languages.
J. Comput. Syst. Sci. 27(1): 101-115 (1983) |
| 1982 |
|---|
| 6 | | Kosaburo Hashiguchi:
Regular Languages of Star Height One
Information and Control 53(3): 199-210 (1982) |
| 5 | | Kosaburo Hashiguchi:
Limitedness Theorem on Finite Automata with Distance Functions.
J. Comput. Syst. Sci. 24(2): 233-244 (1982) |
| 1979 |
|---|
| 4 | | Kosaburo Hashiguchi,
Namio Honda:
The Star Height of Reset-Free Events and Strictly Locally Testable Events
Information and Control 40(3): 267-284 (1979) |
| 3 | | Kosaburo Hashiguchi:
A Decision Procedure for the Order of Regular Events.
Theor. Comput. Sci. 8: 69-72 (1979) |
| 1976 |
|---|
| 2 | | Kosaburo Hashiguchi,
Namio Honda:
Homomorphisms That Preserve Star Height
Information and Control 30(3): 247-266 (1976) |
| 1 | | Kosaburo Hashiguchi,
Namio Honda:
Properties of Code Events and Homomorphisms over Regular Events.
J. Comput. Syst. Sci. 12(3): 352-367 (1976) |
