On complexity of finite moore automata. - Masashi Katsura (Acta Cybern., 1986)

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

Regular Domains. - Masami Ito; Masashi Katsura; Huei-Jan Shyr (J. Inf. Process. Cybern., 1987)

Isomorphisms of group-matrix type automata. - Masashi Katsura (Syst. Comput. Jpn., 1987)

Automorphism Groups and Factor Automata of Strongly Connected Automata. - Masashi Katsura (J. Comput. Syst. Sci., 1988)

Context-free languages consisting of non-primitive words. - Masami Ito; Masashi Katsura (Int. J. Comput. Math., 1991)

Formal Languages Consisting of Primitive Words. - Pál Dömösi; Sándor Horváth; Masami Ito; László Kászonyi; Masashi Katsura (FCT, 1993)

The Shuffle Algebra and its Derivations. - Masashi Katsura; Yuji Kobayashi (Theor. Comput. Sci., 1993)

Groups of Finite Elementary Codes. - Masashi Katsura; Genjiro Tanaka (Theor. Comput. Sci., 1993)

On Transitive Cofinal Automata. - Masami Ito; Masashi Katsura (Mathematical Aspects of Natural and Formal Languages, 1994)

A New Pumping Property of Context-Free Language. - Pál Dömösi; Masami Ito; Masashi Katsura; Chrystopher L. Nehaniv (DMTCS, 1996)

On Shuffle Closure of Commutative Regular Languages. - Balázs Imreh; Masami Ito; Masashi Katsura (DMTCS, 1996)

On a Normal Form of Petri Nets. - Ferucio Laurentiu Tiplea; Masashi Katsura; Masami Ito (Acta Cybern., 1996)

Cross-Sections for Finitely Presented Monoids with Decidable Word Problems. - Friedrich Otto; Masashi Katsura; Yuji Kobayashi (RTA, 1997)

On Termination of Confluent One-Rule String-Rewriting Systems. - Kayoko Shikishima-Tsuji; Masashi Katsura; Yuji Kobayashi (Inf. Process. Lett., 1997)

Processes and Vectorial Characterizations of Parallel Communicating Grammar Systems. - Ferucio Laurentiu Tiplea; Masashi Katsura; Masami Ito (J. Autom. Lang. Comb., 1997)

Infinite Convergent String-Rewriting Systems and Cross-Sections for Finitely Presented Monoids. - Friedrich Otto; Masashi Katsura; Yuji Kobayashi (J. Symb. Comput., 1998)

Undecidability Results for Monoids with Linear-Time Decidable Word Problems. - Masashi Katsura; Yuji Kobayashi; Friedrich Otto (ISAAC, 2000)

Maximal Solid Codes. - Helmut Jürgensen; Masashi Katsura; Stavros Konstantinidis (J. Autom. Lang. Comb., 2001)

Termination and derivational complexity of confluent one-rule string-rewriting systems. - Yuji Kobayashi; Masashi Katsura; Kayoko Shikishima-Tsuji (Theor. Comput. Sci., 2001)

Some Remarks on Primitive Words and Palindromes. - Pál Dömösi; Sándor Horváth; Masami Ito; Masashi Katsura (DCFS, 2003)

Undecidable properties of monoids with word problem solvable in linear time. - Masashi Katsura; Yuji Kobayashi (Theor. Comput. Sci., 2003)

Undecidable properties of monoids with word problem solvable in linear time. Part II– cross sections and homological and homotopical finiteness conditions. - Masashi Katsura; Yuji Kobayashi; Friedrich Otto (Theor. Comput. Sci., 2003)