Kayoko Shikishima-Tsuji

According to our database, Kayoko Shikishima-Tsuji authored at least 11 papers between 1997 and 2016.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2016

Regularity of Iterative Hairpin Completions of Crossing (2, 2)-Words.

Kayoko Shikishima-Tsuji

Int. J. Found. Comput. Sci., 2016

Preface.

Szilárd Zsolt Fazekas, Kayoko Shikishima-Tsuji, Akihiro Yamamura

Int. J. Found. Comput. Sci., 2016

2014

The pseudopalindromic completion of regular languages.

Szilárd Zsolt Fazekas, Florin Manea, Robert Mercas, Kayoko Shikishima-Tsuji

Inf. Comput., 2014

2012

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

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011

Palindromes and Primitivity.

Szilárd Zsolt Fazekas, Peter Leupold, Kayoko Shikishima-Tsuji

Proceedings of the Automata and Formal Languages, 13th International Conference, 2011

2008

Shortest directing words of nondeterministic directable automata.

Masami Ito, Kayoko Shikishima-Tsuji

Discret. Math., 2008

2006

Closure of Language Classes Under Bounded Duplication.

Masami Ito, Peter Leupold, Kayoko Shikishima-Tsuji

Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2004

Some Results on Directable Automata.

Masami Ito, Kayoko Shikishima-Tsuji

Proceedings of the Theory Is Forever, 2004

2001

Termination and derivational complexity of confluent one-rule string-rewriting systems.

Yuji Kobayashi, Masashi Katsura, Kayoko Shikishima-Tsuji

Theor. Comput. Sci., 2001

1997

On Termination of Confluent One-Rule String-Rewriting Systems.

Kayoko Shikishima-Tsuji, Masashi Katsura, Yuji Kobayashi

Inf. Process. Lett., 1997