6 citations · 14 across the 11 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2017
Pumping Lemma for Higher-order Languages
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…
cs.FL2016★ 1 cited
On Word and Frontier Languages of Unsafe Higher-Order Grammars
Kazuyuki Asada, Naoki Kobayashi
Higher-order grammars are extensions of regular and context-free grammars, where non-terminals may take parameters. They have been extensively studied in 1980's, and restudied rece…