Pumping Lemma for Higher-order Languages

DOI10.4230/LIPIcs.ICALP.2017.97zbMath1442.68078arXiv1705.10699OpenAlexW2963912948MaRDI QIDQ5111429

Naoki Kobayashi, Kazuyuki Asada

Publication date: 27 May 2020

Full work available at URL: https://arxiv.org/abs/1705.10699

zbMATH Keywords

pumping lemmaKruskal's tree theoremhigher-order grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (3)

Unnamed Item ⋮ Lambda-Definable Order-3 Tree Functions are Well-Quasi-Ordered ⋮ The Complexity of the Diagonal Problem for Recursion Schemes

This page was built for publication: Pumping Lemma for Higher-order Languages