Kayoko Shikishima-Tsuji

Publication Activity (10 Years)

Years Active: 1997-2016
Publications (10 Years): 2

Top Topics

Regular Languages

Grammatical Inference

Statistical Queries

Top Venues

Int. J. Found. Comput. Sci.

Developments in Language Theory

Publications

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