Aayush Rajasekaran
Aayush Rajasekaran
Email verificata su uwaterloo.ca
Titolo
Citata da
Citata da
Anno
On the state complexity of the shuffle of regular languages
J Brzozowski, G Jirskov, B Liu, A Rajasekaran, M Szykuła
International Conference on Descriptional Complexity of Formal Systems, 73-86, 2016
212016
Sums of palindromes: an approach via automata
A Rajasekaran, J Shallit, T Smith
arXiv preprint arXiv:1706.10206, 2017
82017
Sums of palindromes: an approach via automata
A Rajasekaran, J Shallit, T Smith
arXiv preprint arXiv:1706.10206, 2017
82017
Lagrange's Theorem for Binary Squares
P Madhusudan, D Nowotka, A Rajasekaran, J Shallit
arXiv preprint arXiv:1710.04247, 2017
52017
Additive number theory via automata theory
A Rajasekaran, J Shallit, T Smith
Theory of Computing Systems, 1-26, 2019
42019
Using automata theory to solve problems in additive number theory
A Rajasekaran
University of Waterloo, 2018
32018
Sums of palindromes: an approach via nestedword automata
A Rajasekaran, J Shallit, T Smith
Preprint, available at https://arxiv. org/abs/1706.10206, 2017
22017
Overpals, Underlaps, and Underpals
A Rajasekaran, N Rampersad, J Shallit
International Conference on Combinatorics on Words, 17-29, 2017
2017
Il sistema al momento non pu eseguire l'operazione. Riprova pi tardi.
Articoli 1–8