14
Tree Automata
•Example: S = {0,1,:, Æ, Ç}
•
•A = (S, Q, q0, d, F)
•Q = {false, true}
•q0 = (not needed)
•F = { true }
• d = (e, 0, false), (e, 1, true)
    (false, :, true), (true, :, false)
    (false.false, Æ, false), …, (true.true, Æ, true)
    (false.false, Ç, false), …, (true.true, Ç, true)