WIA
2005
Springer
13 years 10 months ago
2005
Springer
The complexity of various membership problems for tree automata on compressed trees is analyzed. Two compressed representations are considered: dags, which allow to share identical...