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

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

Some Results on Directable Automata. - Masami Ito; Kayoko Shikishima-Tsuji (Theory Is Forever, 2004)

Closure of Language Classes Under Bounded Duplication. - Masami Ito; Peter Leupold; Kayoko Shikishima-Tsuji (Developments in Language Theory, 2006)

Shortest directing words of nondeterministic directable automata. - Masami Ito; Kayoko Shikishima-Tsuji (Discret. Math., 2008)

Palindromes and Primitivity. - Szilárd Zsolt Fazekas; Peter Leupold; Kayoko Shikishima-Tsuji (AFL, 2011)

Hairpin Completion with Bounded Stem-Loop. - Szilárd Zsolt Fazekas; Robert Mercas; Kayoko Shikishima-Tsuji (Developments in Language Theory, 2012)

On Non-Primitive Palindromic Context-Free Languages. - Szilárd Zsolt Fazekas; Peter Leupold; Kayoko Shikishima-Tsuji (Int. J. Found. Comput. Sci., 2012)

The pseudopalindromic completion of regular languages. - Szilárd Zsolt Fazekas; Florin Manea; Robert Mercas; Kayoko Shikishima-Tsuji (Inf. Comput., 2014)

Preface. - Szilárd Zsolt Fazekas; Kayoko Shikishima-Tsuji; Akihiro Yamamura (Int. J. Found. Comput. Sci., 2016)

Regularity of Iterative Hairpin Completions of Crossing (2, 2)-Words. - Kayoko Shikishima-Tsuji (Int. J. Found. Comput. Sci., 2016)