On word and frontier languages of unsafe higher-order grammars

DOI10.4230/LIPICS.ICALP.2016.111zbMath1388.68157arXiv1604.01595OpenAlexW2964277871MaRDI QIDQ4598252

Naoki Kobayashi, Kazuyuki Asada

Publication date: 19 December 2017

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

zbMATH Keywords

intersection typeshigher-order grammars

Mathematics Subject Classification ID

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

Related Items (4)

Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable ⋮ On higher-order reachability games vs may reachability ⋮ Unnamed Item ⋮ Lambda-Definable Order-3 Tree Functions are Well-Quasi-Ordered

This page was built for publication: On word and frontier languages of unsafe higher-order grammars