The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Kosaburo Hashiguchi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.002secs, Finished in 0.304secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002