6 citations · 8 across the 8 of their papers we have counts for
1 paper · 1 filter
Kazuyuki Asada, Naoki Kobayashi
We study a pumping lemma for the word/tree languages generated by higher-order grammars. Pumping lemmas are known up to order-2 word languages (i.e., for regular/context-free/index…