Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable

Keyphrases

• Polynomial Time 100%
• String Transducers 100%
• Domain-specific Languages 50%
• Linear Transducer 50%
• Non-equivalence 50%
• Regular Domain 50%
• Formal Language Theory 50%
• Polynomial Ideals 50%
• Multilinear Algebra 50%
• Inductive Invariants 50%
• Unary 50%

Computer Science

• Polynomial Time 100%
• Efficient Algorithm 50%
• Subclasses 50%
• Formal Language 50%
• Algorithm Semi 50%