default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKosaburo Hashiguchi
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2004
[j28]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
- [j27]Kosaburo Hashiguchi:
Erratum to "New upper bounds to the limitedness of distance automata". Theor. Comput. Sci. 290(3): 2183 (2003) - [j26]Kosaburo Hashiguchi, Yoshito Wada, Shuji Jimbo:
Regular binoid expressions and regular binoid languages. Theor. Comput. Sci. 304(1-3): 291-313 (2003) - 2002
- [j25]Kosaburo Hashiguchi, Kenichi Ishiguro, Shuji Jimbo:
Decidability of The Equivalence Problem for Finitely Ambiguous Finance Automata. Int. J. Algebra Comput. 12(3): 445 (2002) - [j24]Kosaburo Hashiguchi, Takahiro Kunai, Shuji Jimbo:
Finite Codes over Free Binoids. J. Autom. Lang. Comb. 7(4): 505-518 (2002) - [j23]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) - 2001
- [c6]Kosaburo Hashiguchi, Takahiro Kunai, Shuji Jimbo:
Finite Codes over Free Binoids. DCFS 2001: 91-101 - 2000
- [j22]Kosaburo Hashiguchi, Shin Ichihara, Shuji Jimbo:
Formal Languages over Free Binoids. J. Autom. Lang. Comb. 5(3): 219-234 (2000) - [j21]Kosaburo Hashiguchi:
New upper bounds to the limitedness of distance automata. Theor. Comput. Sci. 233(1-2): 19-32 (2000)
1990 – 1999
- 1996
- [c5]Kosaburo Hashiguchi:
New Upper Bounds to the Limitedness of Distance Automata. ICALP 1996: 324-335 - 1994
- [j20]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
- [j19]Kosaburo Hashiguchi, Kazuya Yamada:
String Matching Problems over Free Partially Commutative Monoids. Inf. Comput. 101(2): 131-149 (1992) - [j18]Kosaburo Hashiguchi:
The double reconstruction conjecture about finite colored hypergraphs. J. Comb. Theory B 54(1): 64-76 (1992) - [j17]Kosaburo Hashiguchi, Kazuya Yamada:
Two Recognizable String-Matching Problems Over Free Partially Commutative Monoids. Theor. Comput. Sci. 92(1): 77-86 (1992) - [j16]Heekeun Yoo, Kosaburo Hashiguchi:
Extended Regular Expressions of Arbitrary Star Degrees. Theor. Comput. Sci. 97(2): 217-231 (1992) - [c4]Kosaburo Hashiguchi:
The Double Reconstruction Conjectures about Colored Hypergraphs and Colored Directed Graphs. LATIN 1992: 246-261 - 1991
- [j15]Kosaburo Hashiguchi:
Recognizable Closures and Submonoids of Free Partially Commutative Monoids. Theor. Comput. Sci. 86(2): 233-241 (1991) - [j14]H. Yoo, Kosaburo Hashiguchi:
Extended Automata-Like Regular Expressions of Star Degree At Most (2, 1). Theor. Comput. Sci. 88(2): 351-363 (1991) - [j13]Kosaburo Hashiguchi:
Algorithms for Determining Relative Inclusion Star Height and Inclusion Star Height. Theor. Comput. Sci. 91(1): 85-100 (1991) - [c3]Kosaburo Hashiguchi:
Algorithms for Determining the Smallest Number of Nonterminals (States) Sufficient for Generating (Accepting) a Regular Language. ICALP 1991: 641-648 - 1990
- [j12]Kosaburo Hashiguchi:
Improved Limitedness Theorems on Finite Automata with Distance Functions. Theor. Comput. Sci. 72(1): 27-38 (1990) - [j11]Kosaburo Hashiguchi, H. Yoo:
Extended Regular Expressions of Star Degree at Most Two. Theor. Comput. Sci. 76(2-3): 273-284 (1990)
1980 – 1989
- 1989
- [c2]Kosaburo Hashiguchi:
Algorithms for Determining Relative Star height and Star Height. IFIP Congress 1989: 5-10 - 1988
- [j10]Kosaburo Hashiguchi:
Algorithms for Determining Relative Star Height and Star Height. Inf. Comput. 78(2): 124-169 (1988) - [j9]Kosaburo Hashiguchi:
Notes on Congruence Relations and Factor Pumping Conditions for Rational Languages. Theor. Comput. Sci. 57: 303-316 (1988) - [c1]Kosaburo Hashiguchi:
Relative star height, star height and finite automata with distance functions. Formal Properties of Finite Automata and Applications 1988: 74-88 - 1986
- [j8]Kosaburo Hashiguchi:
Notes on Finitely Generated Semigroups and Pumping Conditions for Regular Languages. Theor. Comput. Sci. 46(3): 53-66 (1986) - 1983
- [j7]Kosaburo Hashiguchi:
Representation Theorems on Regular Languages. J. Comput. Syst. Sci. 27(1): 101-115 (1983) - 1982
- [j6]Kosaburo Hashiguchi:
Regular Languages of Star Height One. Inf. Control. 53(3): 199-210 (1982) - [j5]Kosaburo Hashiguchi:
Limitedness Theorem on Finite Automata with Distance Functions. J. Comput. Syst. Sci. 24(2): 233-244 (1982)
1970 – 1979
- 1979
- [j4]Kosaburo Hashiguchi, Namio Honda:
The Star Height of Reset-Free Events and Strictly Locally Testable Events. Inf. Control. 40(3): 267-284 (1979) - [j3]Kosaburo Hashiguchi:
A Decision Procedure for the Order of Regular Events. Theor. Comput. Sci. 8: 69-72 (1979) - 1976
- [j2]Kosaburo Hashiguchi, Namio Honda:
Homomorphisms That Preserve Star Height. Inf. Control. 30(3): 247-266 (1976) - [j1]Kosaburo Hashiguchi, Namio Honda:
Properties of Code Events and Homomorphisms over Regular Events. J. Comput. Syst. Sci. 12(3): 352-367 (1976)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
