Deciding equivalence of finite tree automata

Keyphrases

• Tree Automata 100%
• Polynomial Time 60%
• Inequivalence 40%
• Log-space 40%
• Polynomial-time Algorithm 20%
• Automata 20%
• Constant Time 20%
• Finite Trees 20%
• Operational Test 20%
• R-test 20%
• PSPACE-complete 20%
• Finite Languages 20%

Computer Science

• Tree Automaton 100%
• Polynomial Time 60%
• Polynomial Time Algorithm 20%
• Automaton 20%