Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345zbMath1156.68446OpenAlexW2494705596MaRDI QIDQ5492856

Arnaud Carayol

Publication date: 20 October 2006

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

Full work available at URL: https://doi.org/10.1007/11549345

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Rewriting Higher-Order Stack Trees ⋮ Rewriting higher-order stack trees ⋮ On first-order logic and CPDA graphs ⋮ On Global Model Checking Trees Generated by Higher-Order Recursion Schemes ⋮ On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems ⋮ Regular sets over extended tree structures

This page was built for publication: Mathematical Foundations of Computer Science 2005