The First-Order Theory of Ground Tree Rewrite Graphs
From MaRDI portal
Publication:5404472
DOI10.2168/LMCS-10(1:7)2014zbMath1325.68121MaRDI QIDQ5404472
Publication date: 24 March 2014
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Automata and formal grammars in connection with logical questions (03D05) Complexity of computation (including implicit computational complexity) (03D15) Grammars and rewriting systems (68Q42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (1)
This page was built for publication: The First-Order Theory of Ground Tree Rewrite Graphs