Masashi Katsura

According to our database1, Masashi Katsura authored at least 21 papers between 1986 and 2003.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2003
Undecidable properties of monoids with word problem solvable in linear time. Part II-- cross sections and homological and homotopical finiteness conditions.
Theor. Comput. Sci., 2003

Undecidable properties of monoids with word problem solvable in linear time.
Theor. Comput. Sci., 2003

Some Remarks on Primitive Words and Palindromes.
Proceedings of the 5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12, 2003

2001
Termination and derivational complexity of confluent one-rule string-rewriting systems.
Theor. Comput. Sci., 2001

Maximal Solid Codes.
Journal of Automata, Languages and Combinatorics, 2001

2000
Undecidability Results for Monoids with Linear-Time Decidable Word Problems.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

1998
Infinite Convergent String-Rewriting Systems and Cross-Sections for Finitely Presented Monoids.
J. Symb. Comput., 1998

1997
Processes and Vectorial Characterizations of Parallel Communicating Grammar Systems.
Journal of Automata, Languages and Combinatorics, 1997

On Termination of Confluent One-Rule String-Rewriting Systems.
Inf. Process. Lett., 1997

Cross-Sections for Finitely Presented Monoids with Decidable Word Problems.
Proceedings of the Rewriting Techniques and Applications, 8th International Conference, 1997

1996
On a Normal Form of Petri Nets.
Acta Cybern., 1996

On Shuffle Closure of Commutative Regular Languages.
Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

A New Pumping Property of Context-Free Language.
Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

1993
Groups of Finite Elementary Codes.
Theor. Comput. Sci., 1993

The Shuffle Algebra and its Derivations.
Theor. Comput. Sci., 1993

Formal Languages Consisting of Primitive Words.
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

1988
Automorphism Groups and Factor Automata of Strongly Connected Automata.
J. Comput. Syst. Sci., 1988

1987
Isomorphisms of group-matrix type automata.
Systems and Computers in Japan, 1987

Regular Domains.
Elektronische Informationsverarbeitung und Kybernetik, 1987

On a problem of Ádám concerning precodes assigned to finite Moore automata.
Acta Cybern., 1987

1986
On complexity of finite moore automata.
Acta Cybern., 1986


  Loading...