Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
tree_automata [2010/05/25 15:32] vkuncak |
tree_automata [2010/05/25 15:32] vkuncak |
||
|---|---|---|---|
| Line 42: | Line 42: | ||
| Deterministic top-down tree automaton: more restrictive. Is there deterministic automaton to check the parity of the number of nodes? | Deterministic top-down tree automaton: more restrictive. Is there deterministic automaton to check the parity of the number of nodes? | ||
| + | |||
| Line 56: | Line 57: | ||
| * intersection | * intersection | ||
| - | Comparison to context-free grammars: closure under intersection and complement | + | Comparison to context-free grammars: closure under intersection and complement. Parser trees are regular, their yield is not. |
| Projection. | Projection. | ||