scientific article; zbMATH DE number 1929935

zbMath1014.68077MaRDI QIDQ4708567

Didier Caucal

Publication date: 18 June 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2420/24200165.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42)

Related Items (19)

Rewriting Higher-Order Stack Trees ⋮ Choice functions and well-orderings over the infinite binary tree ⋮ Rewriting higher-order stack trees ⋮ The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic ⋮ A Hierarchy of Automaticω-Words having a Decidable MSO Theory ⋮ When Is Reachability Intrinsically Decidable? ⋮ Model Transformations in Decidability Proofs for Monadic Theories ⋮ On the structure of graphs in the Caucal hierarchy ⋮ Isomorphism of Regular Trees and Words ⋮ Unnamed Item ⋮ Logical aspects of Cayley-graphs: the group case ⋮ Iterated pushdown automata and sequences of rational numbers ⋮ Unnamed Item ⋮ The Reachability Problem over Infinite Graphs ⋮ On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems ⋮ Automata on infinite trees ⋮ Domains for Higher-Order Games ⋮ Model-Checking Games for Typed λ-Calculi ⋮ Shelah-Stupp's and Muchnik's iterations revisited

This page was built for publication: