The first-order theory of ground tree rewrite graphs

DOI10.2168/LMCS-10(1:7)2014zbMATH Open1325.68121MaRDI QIDQ5404472FDOQ5404472

Authors: Stefan Göller, Markus Lohrey 

Publication date: 24 March 2014

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Recommendations

• The first-order theory of ground tree rewrite graphs
• scientific article; zbMATH DE number 2086416
• scientific article; zbMATH DE number 2086614
• On the computational complexity of the theory of complete binary trees
• Reachability problems on regular ground tree rewriting graphs

zbMATH Keywords

ground tree rewritingalternating complexity classescomplexity of first-order theories

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Automata and formal grammars in connection with logical questions (03D05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Grammars and rewriting systems (68Q42) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (3)

• First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification
• The first-order theory of ground tree rewrite graphs
• Title not available (Why is that?)

This page was built for publication: The first-order theory of ground tree rewrite graphs

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