Follow
Kayoko Shikishima-Tsuji
Kayoko Shikishima-Tsuji
Unknown affiliation
Verified email at sta.tenri-u.ac.jp
Title
Cited by
Cited by
Year
Some results on directable automata
M Ito, K Shikishima-Tsuji
Theory Is Forever: Essays Dedicated to Arto Salomaa on the Occasion of His …, 2004
492004
Closure of language classes under bounded duplication
M Ito, P Leupold, K Shikishima-Tsuji
Developments in Language Theory: 10th International Conference, DLT 2006 …, 2006
232006
Termination and derivational complexity of confluent one-rule string-rewriting systems
Y Kobayashi, M Katsura, K Shikishima-Tsuji
Theoretical computer science 262 (1-2), 583-632, 2001
212001
On termination of confluent one-rule string-rewriting systems
K Shikishima-Tsuji, M Katsura, Y Kobayashi
Information processing letters 61 (2), 91-96, 1997
181997
The pseudopalindromic completion of regular languages
SZ Fazekas, F Manea, R Mercaş, K Shikishima-Tsuji
Information and Computation 239, 222-236, 2014
62014
Shortest directing words of nondeterministic directable automata
M Ito, K Shikishima-Tsuji
Discrete mathematics 308 (21), 4900-4905, 2008
52008
Some periodicity of words and Marcus contextual grammars
P Dömösi, G Horváth, M Ito, K Shikishima-Tsuji
Vietnam Journal of Mathematics 34 (4), 381-387, 2006
42006
Hypertranscendental elements of a formal power-series ring of positive characteristic
K Shikishima-Tsuji, M Katsura
Nagoya mathematical journal 125, 93-103, 1992
41992
Regularity of iterative hairpin completions of crossing (2, 2)-words
K Shikishima-Tsuji
International Journal of Foundations of Computer Science 27 (03), 375-389, 2016
32016
On non-primitive palindromic context-free languages
SZ Fazekas, P Leupold, K Shikishima-Tsuji
International Journal of Foundations of Computer Science 23 (06), 1277-1289, 2012
22012
Hairpin completion with bounded stem-loop
SZ Fazekas, R Mercaş, K Shikishima-Tsuji
International Conference on Developments in Language Theory, 428-439, 2012
22012
Galois theory of differential fields of positive characteristic.
K Shikishima-Tsuji
21989
Conjecture about Regularity of Prefix Square Roots of Regular Languages (代数系, 論理, 言語とその周辺領域)
K Shikishima-Tsuji
数理解析研究所講究録, 119-121, 2018
2018
Conjecture about Regularity of Prefix Square Roots of Regular Languages (Algebras, logics, languages and related areas)
K Shikishima-Tsuji
数理解析研究所講究録 2096, 119-121, 2018
2018
Compression of Palindromes and Regularity.(Developments of Language, Logic, Algebraic system and Computer Science)
K Shikishima-Tsuji
数理解析研究所講究録 2051, 143-148, 2017
2017
Compression of Palindromes and Regularity.(Developments of
K Shikishima-Tsuji
数理解析研究所講究録 2051, 143-148, 2017
2017
Special Issue Sernigroups, Languages and Algebras
SZ Fazekas, K Shikishima-Tsuji, A Yamamura
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 27 (3), 301-303, 2016
2016
Palindromic completion: a new operation (Algebraic Systems and Theoretical Computer Science)
SZ Fazekas, R Mercas, K Shikishima-Tsuji
数理解析研究所講究録 1809, 128-139, 2012
2012
Some Periodicity of Words and Marcus Contextual Grammars (Algorithmic problems in algebra, languages and computation systems)
P Domosi, G Horvath, M Ito, K Shikishima-Tsuji
数理解析研究所講究録 1503, 156-159, 2006
2006
Some Periodicity of Words and Marcus Contextual Grammars
M Ito, K Shikishima-Tsuji
数理解析研究所講究録 1503, 156-159, 2006
2006
The system can't perform the operation now. Try again later.
Articles 1–20