Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time.

Adrien Boiret Raphaela Palenta

Published in: DLT (2016)

Keyphrases

finite automata
tree structure
co occurrence
computational complexity
special case
closed form
linear space
approximation algorithms
linear systems
natural language text
linear constraints
word recognition
query processing
n gram
hierarchical structure
binary tree