Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars.

Sebastian Eberhard Gabriel Ebner Stefan Hetzl

Published in: ACM Trans. Comput. Log. (2017)

Keyphrases

tree languages
context free
grammatical inference
tree automata
positive data
context sensitive
finite automata
context free grammars
context dependent
finite state
inductive inference
natural language
tree patterns
high level
object oriented
integrity constraints