| Complexity results on register context-free grammars and register tree automata R Senda, Y Takata, H Seki Theoretical Aspects of Computing–ICTAC 2018: 15th International Colloquium …, 2018 | 9 | 2018 |
| Generalized register context-free grammars R Senda, Y Takata, H Seki IEICE TRANSACTIONS on Information and Systems 103 (3), 540-548, 2020 | 7 | 2020 |
| Forward regularity preservation property of register pushdown systems R Senda, Y Takata, H Seki IEICE TRANSACTIONS on Information and Systems 104 (3), 370-380, 2021 | 5 | 2021 |
| LTL model checking for register pushdown systems R Senda, Y Takata, H Seki IEICE TRANSACTIONS on Information and Systems 104 (12), 2131-2144, 2021 | 4 | 2021 |
| Reactive synthesis from visibly register pushdown automata R Senda, Y Takata, H Seki International Colloquium on Theoretical Aspects of Computing, 334-353, 2021 | 3 | 2021 |
| A Subclass of Mu-Calculus with the Freeze Quantifier Equivalent to Register Automata Y Takata, A Onishi, R Senda, H Seki IEICE TRANSACTIONS on Information and Systems 106 (3), 294-302, 2023 | 2 | 2023 |
| Complexity results on register context-free grammars and related formalisms R Senda, Y Takata, H Seki Theoretical Computer Science 923, 99-125, 2022 | 2 | 2022 |
| Complexity results on register pushdown automata R Senda, Y Takata, H Seki arXiv preprint arXiv:1910.10357, 2019 | 1 | 2019 |
| A Subclass of Mu-Calculus with the Freeze Quantifier Equivalent to Buchi Register Automata Y Takata, A Onishi, R Senda, H Seki arXiv preprint arXiv:2406.11351, 2024 | | 2024 |
| Reduction of Register Pushdown Systems with Freshness Property to Pushdown Systems in LTL Model Checking Y Takata, R Senda, H Seki IEICE TRANSACTIONS on Information and Systems 105 (9), 1620-1623, 2022 | | 2022 |
| Pumping Lemmas for Languages Expressed by Computational Models with Registers R Nakanishi, R Senda, Y Takata, H Seki IEICE Technical Report; IEICE Tech. Rep. 120 (343), 72-77, 2021 | | 2021 |
| LTL Model Checking for Register Pushdown Systems R Senda, Y Takata, H Seki IEICE Technical Report; IEICE Tech. Rep. 120 (193), 7-12, 2020 | | 2020 |
| Computational Complexity of Membership and Emptiness Problems for Register Context-Free Grammars R Senda, H Seki IEICE Technical Report; IEICE Tech. Rep. 117 (381), 41-46, 2018 | | 2018 |
| A study on Computational Models with Registers and their Application to Software Construction R Senda | | |
| A Subclass of Mu-Calculus Equivalent to Register Automata A Onishi, R Senda, Y Takata, H Seki IEICE Technical Report; IEICE Tech. Rep., 0 | | |
