Rewriting Higher-Order Stack Trees

DOI10.1007/978-3-319-20297-6_24zbMath1378.68109arXiv1502.04653OpenAlexW2610345475MaRDI QIDQ3194729

Vincent Penelle

Publication date: 20 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (1)

Rewriting higher-order stack trees

Cites Work

• Finite presentations of infinite structures: Automata and interpretations
• Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection
• A Saturation Method for Collapsible Pushdown Systems
• Traces of term-automatic graphs
• Decidability of second-order theories and automata on infinite trees
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Transforming structures by set interpretations
• Mathematical Foundations of Computer Science 2005
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Rewriting Higher-Order Stack Trees