Kosaburo Hashiguchi - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 34 from 34

2004

Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoidsKosaburo Hashiguchi, Naoto Sakakibara, Shuji Jimbo. TCS, 312(2-3):251-266, 2004. [doi]

2003

Erratum to New upper bounds to the limitedness of distance automata Kosaburo Hashiguchi. TCS, 290(3):2183, 2003.

Regular binoid expressions and regular binoid languagesKosaburo Hashiguchi, Yoshito Wada, Shuji Jimbo. TCS, 1-3(304):291-313, 2003. [doi]

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, R2Kosaburo Hashiguchi. TCS, 289(1):853-859, 2002.

Decidability of The Equivalence Problem for Finitely Ambiguous Finance AutomataKosaburo Hashiguchi, Kenichi Ishiguro, Shuji Jimbo. ijac, 12(3):445, 2002. [doi]

Finite Codes over Free BinoidsKosaburo Hashiguchi, Takahiro Kunai, Shuji Jimbo. jalc, 7(4):505-518, 2002.

2001

Finite Codes over Free BinoidsKosaburo Hashiguchi, Takahiro Kunai, Shuji Jimbo. dcfs 2001: 91-101

2000

Formal Languages over Free BionoidsKosaburo Hashiguchi, Shin Ichihara, Shuji Jimbo. jalc, 5(3):219-234, 2000.

New upper bounds to the limitedness of distance automataKosaburo Hashiguchi. TCS, 233(1-2):19-32, 2000. [doi]

1996

New Upper Bounds to the Limitedness of Distance AutomataKosaburo Hashiguchi. icalp 1996: 324-335

1994

The Infinite 2-Star Height Hierarchy of Extended Regular Languages of Star Degree at Most TwoKosaburo Hashiguchi. iandc, 114(2):237-246, November 1994.

1992

The Double Reconstruction Conjectures about Colored Hypergraphs and Colored Directed GraphsKosaburo Hashiguchi. latin 1992: 246-261

The double reconstruction conjecture about finite colored hypergraphsKosaburo Hashiguchi. JCT, 54(1):64-76, 1992. [doi]

String Matching Problems over Free Partially Commutative MonoidsKosaburo Hashiguchi, Kazuya Yamada. iandc, 101(2):131-149, December 1992.

Two Recognizable String-Matching Problems Over Free Partially Commutative MonoidsKosaburo Hashiguchi, Kazuya Yamada. TCS, 92(1):77-86, 1992.

Extended Regular Expressions of Arbitrary Star DegreesHeekeun Yoo, Kosaburo Hashiguchi. TCS, 97(2):217-231, 1992.

1991

Algorithms for Determining Relative Inclusion Star Height and Inclusion Star HeightKosaburo Hashiguchi. TCS, 91(1):85-100, 1991.

Recognizable Closures and Submonoids of Free Partially Commutative MonoidsKosaburo Hashiguchi. TCS, 86(2):233-241, 1991.

Algorithms for Determining the Smallest Number of Nonterminals (States) Sufficient for Generating (Accepting) a Regular LanguageKosaburo Hashiguchi. icalp 1991: 641-648

Extended Automata-Like Regular Expressions of Star Degree At Most (2, 1)H. Yoo, Kosaburo Hashiguchi. TCS, 88(2):351-363, 1991.

1990

Improved Limitedness Theorems on Finite Automata with Distance FunctionsKosaburo Hashiguchi. TCS, 72(1):27-38, 1990.

Extended Regular Expressions of Star Degree at Most TwoKosaburo Hashiguchi, H. Yoo. TCS, 76(2-3):273-284, 1990.

1989

Algorithms for Determining Relative Star height and Star HeightKosaburo Hashiguchi. ifip 1989: 5-10

1988

Relative star height, star height and finite automata with distance functionsKosaburo Hashiguchi. litp 1989: 74-88

Notes on Congruence Relations and Factor Pumping Conditions for Rational LanguagesKosaburo Hashiguchi. TCS, 57:303-316, 1988.

Algorithms for Determining Relative Star Height and Star HeightKosaburo Hashiguchi. iandc, 78(2):124-169, August 1988.

1986

Notes on Finitely Generated Semigroups and Pumping Conditions for Regular LanguagesKosaburo Hashiguchi. TCS, 46(3):53-66, 1986.

1983

Representation Theorems on Regular LanguagesKosaburo Hashiguchi. jcss, 27(1):101-115, 1983.

1982

Regular Languages of Star Height OneKosaburo Hashiguchi. iandc, 53(3):199-210, June 1982.

Limitedness Theorem on Finite Automata with Distance FunctionsKosaburo Hashiguchi. jcss, 24(2):233-244, 1982.

1979

A Decision Procedure for the Order of Regular EventsKosaburo Hashiguchi. TCS, 8:69-72, 1979.

The Star Height of Reset-Free Events and Strictly Locally Testable EventsKosaburo Hashiguchi, Namio Honda. iandc, 40(3):267-284, March 1979.

1976

Properties of Code Events and Homomorphisms over Regular EventsKosaburo Hashiguchi, Namio Honda. jcss, 12(3):352-367, 1976.

Homomorphisms That Preserve Star HeightKosaburo Hashiguchi, Namio Honda. iandc, 30(3):247-266, March 1976.

Sign in or sign up to see more results.

runs on WebDSL