Pumping by typing

DOI10.1109/LICS.2013.46MaRDI QIDQ5271077zbMATH OpenOpenAlexFDO

Authors Naoki Kobayashi

Publication date 3 July 2017

Published in 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/lics.2013.46

zbMATH Keywords

pumping lemma

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Pumping Lemma for Higher-order Languages
• scientific article; zbMATH DE number 5825969
• Strictness of the collapsible pushdown hierarchy
• Böhm trees as higher-order recursion schemes
• On Global Model Checking Trees Generated by Higher-Order Recursion Schemes

Cited in

(8)

• Exact bounds for acyclic higher-order recursion schemes
• Pumping and pushdown machines
• scientific article; zbMATH DE number 1148299 (Why is no real title available?)
• Intersection types for unboundedness problems
• Lambda-Definable Order-3 Tree Functions are Well-Quasi-Ordered
• On the expressivity of linear recursion schemes
• The Complexity of the Diagonal Problem for Recursion Schemes
• A characterization of lambda-terms transforming numerals

This page was built for publication: Pumping by typing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5271077)