10
Regular Ranked Tree Languages
•
Background:
•
Given two
ranked
-tree automata A
1
, A
2
,
checking L(A
1
)
µ
L(A
2
) is EXPTIME
complete
•
Note: if A_2 is deterministic, then one can
check containment in time |A_1| |A_2|
•