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)

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

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

Hairpin Completion with Bounded Stem-Loop - Szilárd Zsolt Fazekas; Robert Mercas; Kayoko Shikishima-Tsuji (Developments in Language Theory - 16th International Conference, DLT 2012, Taipei, Taiwan, August 14-17, 2012. Proceedings, 2012)

Palindromes and Primitivity - Szilárd Zsolt Fazekas; Peter Leupold; Kayoko Shikishima-Tsuji (Automata and Formal Languages, 13th International Conference, AFL 2011, Debrecen, Hungary, August 17-22, 2011, Proceedings, 2011)

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

Closure of Language Classes Under Bounded Duplication - Masami Ito; Peter Leupold; Kayoko Shikishima-Tsuji (Developments in Language Theory, 10th International Conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006, Proceedings, 2006)

Some Results on Directable Automata - Masami Ito; Kayoko Shikishima-Tsuji (Theory Is Forever, Essays Dedicated to Arto Salomaa on the Occasion of His 70th Birthday, 2004)

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

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