tree_automaton_top_down (349B)
1 # Tree automaton top down 2 3 - [automata_deterministic]: [tDTA] 4 - leads to a weaker class of languages 5 - [Boolean_closure]: [Boolean_closure_tDTA] 6 - [unambiguous]: [tUTA] 7 - has same [expressiveness] as [bUTA] 8 - (the unambiguity condition is symmetric) 9 - [nondeterministic]: [tNTA] 10 - has same [expressiveness] as [bNTA] 11 12 Up: [tree_automaton]