Kosaburo Hashiguchi

According to our database1, Kosaburo Hashiguchi authored at least 31 papers between 1976 and 2004.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2004
Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids.
Theor. Comput. Sci., 2004

2003
Regular binoid expressions and regular binoid languages.
Theor. Comput. Sci., 2003

Erratum to "New upper bounds to the limitedness of distance automata".
Theor. Comput. Sci., 2003

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, R2.
Theor. Comput. Sci., 2002

Finite Codes over Free Binoids.
J. Autom. Lang. Comb., 2002

Decidability of The Equivalence Problem for Finitely Ambiguous Finance Automata.
Int. J. Algebra Comput., 2002

2000
New upper bounds to the limitedness of distance automata.
Theor. Comput. Sci., 2000

Formal Languages over Free Binoids.
J. Autom. Lang. Comb., 2000

1994
The Infinite 2-Star Height Hierarchy of Extended Regular Languages of Star Degree at Most Two
Inf. Comput., November, 1994

1992
String Matching Problems over Free Partially Commutative Monoids
Inf. Comput., December, 1992

Extended Regular Expressions of Arbitrary Star Degrees.
Theor. Comput. Sci., 1992

Two Recognizable String-Matching Problems Over Free Partially Commutative Monoids.
Theor. Comput. Sci., 1992

The double reconstruction conjecture about finite colored hypergraphs.
J. Comb. Theory B, 1992

The Double Reconstruction Conjectures about Colored Hypergraphs and Colored Directed Graphs.
Proceedings of the LATIN '92, 1992

1991
Extended Automata-Like Regular Expressions of Star Degree At Most (2, 1).
Theor. Comput. Sci., 1991

Algorithms for Determining Relative Inclusion Star Height and Inclusion Star Height.
Theor. Comput. Sci., 1991

Recognizable Closures and Submonoids of Free Partially Commutative Monoids.
Theor. Comput. Sci., 1991

Algorithms for Determining the Smallest Number of Nonterminals (States) Sufficient for Generating (Accepting) a Regular Language.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990
Extended Regular Expressions of Star Degree at Most Two.
Theor. Comput. Sci., 1990

Improved Limitedness Theorems on Finite Automata with Distance Functions.
Theor. Comput. Sci., 1990

1988
Algorithms for Determining Relative Star Height and Star Height
Inf. Comput., August, 1988

Notes on Congruence Relations and Factor Pumping Conditions for Rational Languages.
Theor. Comput. Sci., 1988

Relative star height, star height and finite automata with distance functions.
Proceedings of the Formal Properties of Finite Automata and Applications, 1988

1986
Notes on Finitely Generated Semigroups and Pumping Conditions for Regular Languages.
Theor. Comput. Sci., 1986

1983
Representation Theorems on Regular Languages.
J. Comput. Syst. Sci., 1983

1982
Regular Languages of Star Height One
Inf. Control., June, 1982

Limitedness Theorem on Finite Automata with Distance Functions.
J. Comput. Syst. Sci., 1982

1979
The Star Height of Reset-Free Events and Strictly Locally Testable Events
Inf. Control., March, 1979

A Decision Procedure for the Order of Regular Events.
Theor. Comput. Sci., 1979

1976
Homomorphisms That Preserve Star Height
Inf. Control., March, 1976

Properties of Code Events and Homomorphisms over Regular Events.
J. Comput. Syst. Sci., 1976


  Loading...