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

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

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

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

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

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

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

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

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

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

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