7 citations · 15 across the 8 of their papers we have counts for
1 paper · 2 filters
Ashwin Nayak
Consider the finite regular language L_n = {w0 : w \in {0,1}^*, |w| \le n}. It was shown by Ambainis, Nayak, Ta-Shma and Vazirani that while this language is accepted by a determin…