Abstract
Straight-line (linear) context-free tree (SLT) grammars have been used to compactly represent ordered trees. Equivalence of SLT grammars is decidable in polynomial time. Here we extend this result and show that isomorphism of unordered trees given as SLT grammars is decidable in polynomial time. The result generalizes to isomorphism of unrooted trees and bisimulation equivalence. For non-linear SLT grammars which can have double-exponential compression ratios, we prove that unordered isomorphism and bisimulation equivalence are PSPACE-hard and in EXPTIME.
Cite
CITATION STYLE
Lohrey, M., Maneth, S., & Peternek, F. (2015). Compressed tree canonization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9135, pp. 337–349). Springer Verlag. https://doi.org/10.1007/978-3-662-47666-6_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
