49 citations · 281 across the 55 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
cs.FL2009
Pseudorandom Generators Against Advised Context-Free Languages
Tomoyuki Yamakami
Pseudorandomness has played a central role in modern cryptography, finding theoretical and practical applications to various fields of computer science. A function that generates p…
cs.CC2009★ 23 cited
Immunity and Pseudorandomness of Context-Free Languages
Tomoyuki Yamakami
We discuss the computational complexity of context-free languages, concentrating on two well-known structural properties---immunity and pseudorandomness. An infinite language is RE…