| |
| 2008 | ||
|---|---|---|
| 5 | EE | Masami Ito, Kayoko Shikishima-Tsuji: Shortest directing words of nondeterministic directable automata. Discrete Mathematics 308(21): 4900-4905 (2008) |
| 2006 | ||
| 4 | EE | Masami Ito, Peter Leupold, Kayoko Shikishima-Tsuji: Closure of Language Classes Under Bounded Duplication. Developments in Language Theory 2006: 238-247 |
| 2004 | ||
| 3 | EE | Masami Ito, Kayoko Shikishima-Tsuji: Some Results on Directable Automata. Theory Is Forever 2004: 125-133 |
| 2001 | ||
| 2 | EE | Yuji Kobayashi, Masashi Katsura, Kayoko Shikishima-Tsuji: Termination and derivational complexity of confluent one-rule string-rewriting systems. Theor. Comput. Sci. 262(1): 583-632 (2001) |
| 1997 | ||
| 1 | EE | Kayoko Shikishima-Tsuji, Masashi Katsura, Yuji Kobayashi: On Termination of Confluent One-Rule String-Rewriting Systems. Inf. Process. Lett. 61(2): 91-96 (1997) |
| 1 | Masami Ito | [3] [4] [5] |
| 2 | Masashi Katsura | [1] [2] |
| 3 | Yuji Kobayashi | [1] [2] |
| 4 | Peter Leupold | [4] |