M. Katsura - Citegraph

Author Info

Name	Affiliation	Papers
M. KATSURA	Kyoto Sangyo Univ., Kyoto, Japan	20
Collaborators	Citations	PageRank
18	58	10.49
Referers	Referees	References
60	57	64

Publications (20 rows)

Collaborators (18 rows)

Referers (60 rows)

Referees (57 rows)

Title	Citations	PageRank	Year
Undecidable properties of monoids with word problem solvable in linear time	2	0.37	2003
Some Remarks on Primitive Words and Palindromes.	0	0.34	2003
Undecidable properties of monoids with word problem solvable in linear time. Part II— cross sections and homological and homotopical finiteness conditions	1	0.34	2003
Termination and derivational complexity of confluent one-rule string-rewriting systems	8	0.73	2001
Undecidability Results for Monoids with Linear-Time Decidable Word Problems	0	0.34	2000
Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids	11	0.77	1998
Cross-Sections for Finitely Presented Monoids with Decidable Word Problems	5	0.74	1997
Processes and vectorial characterizations of parallel communicating grammar systems	0	0.34	1997
On termination of confluent one-rule string-rewriting systems	8	1.44	1997
On a Normal Form of Petri Nets	0	0.34	1996
A New Pumping Property of Context-Free Language.	0	0.34	1996
On Shuffle Closure of Commutative Regular Languages.	2	0.57	1996
Formal Languages Consisting of Primitive Words	12	0.90	1993
Groups of finite elementary codes	0	0.34	1993
The shuffle algebra and its derivations	1	0.37	1993
Context-Free Languages Consisting Of Non-Primitive Words	8	0.88	1991
Automorphism groups and factor automata of strongly connected automata	0	0.34	1988
Regular domains	0	0.34	1987
On a problem of Ádám concerning procodes assigned to finite Moore automata	0	0.34	1987
Isomorphisms of group-matrix type automata.	0	0.34	1987