Kayoko Shikishima-Tsuji

11 papers C 2Journal 7Unranked 2
YearRankTypeTitle / Venue / Authors
2016 J jnl
Preface.
Int. J. Found. Comput. Sci.
Szilárd Zsolt Fazekas, Kayoko Shikishima-Tsuji, Akihiro Yamamura
2016 J jnl
Regularity of Iterative Hairpin Completions of Crossing (2, 2)-Words.
Int. J. Found. Comput. Sci.
Kayoko Shikishima-Tsuji
2014 J jnl
The pseudopalindromic completion of regular languages.
Inf. Comput.
Szilárd Zsolt Fazekas, Florin Manea, Robert Mercas, Kayoko Shikishima-Tsuji
2012 C conf
Hairpin Completion with Bounded Stem-Loop.
Developments in Language Theory
Szilárd Zsolt Fazekas, Robert Mercas, Kayoko Shikishima-Tsuji
2012 J jnl
On Non-Primitive Palindromic Context-Free Languages.
Int. J. Found. Comput. Sci.
Szilárd Zsolt Fazekas, Peter Leupold, Kayoko Shikishima-Tsuji
2011 — conf
Palindromes and Primitivity.
AFL
Szilárd Zsolt Fazekas, Peter Leupold, Kayoko Shikishima-Tsuji
2008 J jnl
Shortest directing words of nondeterministic directable automata.
Discret. Math.
Masami Ito, Kayoko Shikishima-Tsuji
2006 C conf
Closure of Language Classes Under Bounded Duplication.
Developments in Language Theory
Masami Ito, Peter Leupold, Kayoko Shikishima-Tsuji
2004 — conf
Some Results on Directable Automata.
Theory Is Forever
Masami Ito, Kayoko Shikishima-Tsuji
2001 J jnl
Termination and derivational complexity of confluent one-rule string-rewriting systems.
Theor. Comput. Sci.
Yuji Kobayashi, Masashi Katsura, Kayoko Shikishima-Tsuji
1997 J jnl
On Termination of Confluent One-Rule String-Rewriting Systems.
Inf. Process. Lett.
Kayoko Shikishima-Tsuji, Masashi Katsura, Yuji Kobayashi