Unambiguous Tree Languages Are Topologically Harder Than Deterministic Ones

Szczepan Hummel

Published in: GandALF (2012)

Keyphrases

tree languages
tree automata
context free
positive data
tree patterns
database
training data
context free grammars