Rewriting higher-order stack trees

DOI10.1007/s00224-017-9769-6zbMath1378.68110OpenAlexW1502345479WikidataQ59603764 ScholiaQ59603764MaRDI QIDQ2411043

Vincent Penelle

Publication date: 20 October 2017

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-017-9769-6

zbMATH Keywords

automata theoryrewritinginfinite graphsstack trees

Mathematics Subject Classification ID

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

Related Items

The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
• 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
• Rewriting Higher-Order Stack Trees
• 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