Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable.
Helmut SeidlSebastian ManethGregor KemperPublished in: CoRR (2015)
Keyphrases
- datalog programs
- suffix tree
- tree structure
- pattern matching
- finite automata
- tree structures
- data structure
- finite state automata
- tree models
- binary tree
- string matching
- spanning tree
- regular expressions
- high level
- query containment
- tree automata
- first order logic
- tree edit distance
- tree search
- tree construction
- approximate string matching
- monadic second order logic