Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable.
Helmut SeidlSebastian ManethGregor KemperPublished in: J. ACM (2018)
Keyphrases
- suffix tree
- datalog programs
- tree structure
- query containment
- data structure
- finite state automata
- regular expressions
- high level
- index structure
- tree edit distance
- tree construction
- string matching
- binary tree
- finite automata
- tree structures
- b tree
- hamming distance
- approximate string matching
- edit distance
- edit operations