Masashi Katsura

23 papers B 2Journal 16Unranked 4
YearRankTypeTitle / Venue / Authors
2003 — conf
Some Remarks on Primitive Words and Palindromes.
DCFS
Pál Dömösi, Sándor Horváth, Masami Ito, Masashi Katsura
2003 J jnl
Undecidable properties of monoids with word problem solvable in linear time.
Theor. Comput. Sci.
Masashi Katsura, Yuji Kobayashi
2003 J jnl
Undecidable properties of monoids with word problem solvable in linear time. Part II-- cross sections and homological and homotopical finiteness conditions.
Theor. Comput. Sci.
Masashi Katsura, Yuji Kobayashi, Friedrich Otto
2001 J jnl
Maximal Solid Codes.
J. Autom. Lang. Comb.
Helmut Jürgensen, Masashi Katsura, Stavros Konstantinidis
2001 J jnl
Termination and derivational complexity of confluent one-rule string-rewriting systems.
Theor. Comput. Sci.
Yuji Kobayashi, Masashi Katsura, Kayoko Shikishima-Tsuji
2000 B conf
Undecidability Results for Monoids with Linear-Time Decidable Word Problems.
ISAAC
Masashi Katsura, Yuji Kobayashi, Friedrich Otto
1998 J jnl
Infinite Convergent String-Rewriting Systems and Cross-Sections for Finitely Presented Monoids.
J. Symb. Comput.
Friedrich Otto, Masashi Katsura, Yuji Kobayashi
1997 — conf
Cross-Sections for Finitely Presented Monoids with Decidable Word Problems.
RTA
Friedrich Otto, Masashi Katsura, Yuji Kobayashi
1997 J jnl
On Termination of Confluent One-Rule String-Rewriting Systems.
Inf. Process. Lett.
Kayoko Shikishima-Tsuji, Masashi Katsura, Yuji Kobayashi
1997 J jnl
Processes and Vectorial Characterizations of Parallel Communicating Grammar Systems.
J. Autom. Lang. Comb.
Ferucio Laurentiu Tiplea, Masashi Katsura, Masami Ito
1996 — conf
A New Pumping Property of Context-Free Language.
DMTCS
Pál Dömösi, Masami Ito, Masashi Katsura, Chrystopher L. Nehaniv
1996 — conf
On Shuffle Closure of Commutative Regular Languages.
DMTCS
Balázs Imreh, Masami Ito, Masashi Katsura
1996 J jnl
On a Normal Form of Petri Nets.
Acta Cybern.
Ferucio Laurentiu Tiplea, Masashi Katsura, Masami Ito
1994 — ch.
On Transitive Cofinal Automata.
Mathematical Aspects of Natural and Formal Languages
Masami Ito, Masashi Katsura
1993 B conf
Formal Languages Consisting of Primitive Words.
FCT
Pál Dömösi, Sándor Horváth, Masami Ito, László Kászonyi, Masashi Katsura
1993 J jnl
Groups of Finite Elementary Codes.
Theor. Comput. Sci.
Masashi Katsura, Genjiro Tanaka
1993 J jnl
The Shuffle Algebra and its Derivations.
Theor. Comput. Sci.
Masashi Katsura, Yuji Kobayashi
1991 J jnl
Context-free languages consisting of non-primitive words.
Int. J. Comput. Math.
Masami Ito, Masashi Katsura
1988 J jnl
Automorphism Groups and Factor Automata of Strongly Connected Automata.
J. Comput. Syst. Sci.
Masashi Katsura
1987 J jnl
Isomorphisms of group-matrix type automata.
Syst. Comput. Jpn.
Masashi Katsura
1987 J jnl
On a problem of Ádám concerning precodes assigned to finite Moore automata.
Acta Cybern.
Masashi Katsura
1987 J jnl
Regular Domains.
J. Inf. Process. Cybern.
Masami Ito, Masashi Katsura, Huei-Jan Shyr
1986 J jnl
On complexity of finite moore automata.
Acta Cybern.
Masashi Katsura