Graduate School of Engineering
Mie University
1577 Kurimamachiya-cho, Tsu, Mie 514-8507, Japan
senda [at] info.mie-u.ac.jp
April 2024 - present: Project Assistant Professor at Graduate School of Engineering , Mie University.
April 2022 - March 2024: Postdoctoral researcher at RIKEN Center for Advanced Intelligence Project.
Quantum Algorithms
Formal Language Theory
Ph.D. (Informatics) at Graduate School of Informatics, Nagoya University, March 2022
Journal Papers
Yoshiaki Takata, Akira Ohishi, Ryoma Senda, Hiroyuki Seki, A Subclass of Mu-Calculus with the Freeze Quantifier Equivalent to Register Automata, IEICE Transactions on Information and Systems, Vol.E106-D, No.3, pp.294-302, March 2023.
Ryoma Senda, Yoshiaki Takata and Hiroyuki Seki, Complexity Results on Register Context-Free Grammars and Related Formalisms, Theoretical Computer Science, Vol.923, pp.99-125, Jun 2022.
Ryoma Senda, Yoshiaki Takata and Hiroyuki Seki, LTL Model Checking for Register Pushdown Systems, IEICE Transactions on Information and Systems, Vol.E104-D, No.12, pp.2131-2144, Dec 2021.
Ryoma Senda, Yoshiaki Takata and Hiroyuki Seki, Forward Regularity Preservation Property of Register Pushdown Systems, IEICE Transactions on Information and Systems, Vol.E104-D, No.3, pp.370-380, March 2021.
Ryoma Senda, Yoshiaki Takata and Hiroyuki Seki, Generalized Register Context-Free Grammars, IEICE Transactions on Information and Systems, Vol.E103-D, No.3, pp.540-548, March 2020.
Conference Papers
Ryoma Senda, Yoshiaki Takata and Hiroyuki Seki, Reactive Synthesis from Visibly Register Pushdown Automata, 18th International Colloquium on Theoretical Aspects of Computing (ICTAC 2021), Lecture Notes in Computer Science 12819, pp.334-353, 2021.
Ryoma Senda, Yoshiaki Takata and Hiroyuki Seki, Complexity Results on Register Pushdown Automata, 3rd Workshop on Software Foundations for Data Interoperability (SFDI2019+), short paper, Fukuoka, Oct 28, 2019. https://arxiv.org/abs/1910.10357v1
Ryoma Senda, Yoshiaki Takata and Hiroyuki Seki, Generalized Register Context-Free Grammars, 13th International Conference on Language and Automata Theory and Applications (LATA 2019), Lecture Notes in Computer Science 11417, pp.259-271, March 2019.
Ryoma Senda, Yoshiaki Takata and Hiroyuki Seki, Complexity Results on Register Context-Free Grammars and Register Tree Automata, 15th International Colloquium on Theoretical Aspects of Computing (ICTAC 2018), Lecture Notes in Computer Science 11187, pp.415-434. Oct 2018.