Computing Simulations over Tree Automata


We address the problem of computing simulation relations over tree automata. In particular, we consider downward and upward simulations on tree automata, which are, loosely speaking, analogous to forward and backward relations over word automata. We provide simple and efficient algorithms for computing these relations based on a reduction to the problem of… (More)
DOI: 10.1007/978-3-540-78800-3_8


1 Figure or Table


Citations per Year

Citation Velocity: 15

Averaging 15 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.