On the state complexity of the shuffle of regular languages J Brzozowski, G Jirásková, B Liu, A Rajasekaran, M Szykuła International Conference on Descriptional Complexity of Formal Systems, 73-86, 2016 | 28 | 2016 |
Additive number theory via automata theory A Rajasekaran, J Shallit, T Smith Theory of Computing Systems 64, 542-567, 2020 | 27 | 2020 |
Sums of palindromes: an approach via automata A Rajasekaran, J Shallit, T Smith arXiv preprint arXiv:1706.10206, 2017 | 16 | 2017 |
Lagrange's Theorem for Binary Squares P Madhusudan, D Nowotka, A Rajasekaran, J Shallit arXiv preprint arXiv:1710.04247, 2017 | 7 | 2017 |
Using automata theory to solve problems in additive number theory A Rajasekaran University of Waterloo, 2018 | 3 | 2018 |
Sums of palindromes: an approach via nestedword automata A Rajasekaran, J Shallit, T Smith Preprint, available at https://arxiv. org/abs/1706.10206, 2017 | 2 | 2017 |
Overpals, underlaps, and underpals A Rajasekaran, N Rampersad, J Shallit Combinatorics on Words: 11th International Conference, WORDS 2017, Montréal …, 2017 | 1 | 2017 |
43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018) L Bulteau, ML Schmid, M Andreev, G Posobin, A Shen, H Abasi, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2018 | | 2018 |