# Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time

## TL;DR

This paper introduces a new polynomial-time decision procedure for equivalence of separated non-nested attribute systems, extending previous results to partial transducers and string-parameterized transducers.

## Contribution

It presents an alternative polynomial-time algorithm for deciding equivalence, improving upon previous methods and extending applicability to more general transducer models.

## Key findings

- New polynomial-time decision procedure for transducer equivalence
- Extension to partial transducers and string-parameterized transducers
- Improved efficiency over previous methods

## Abstract

In 1982, Courcelle and Franchi-Zannettacci showed that the equivalence problem of separated non-nested attribute systems can be reduced to the equivalence problem of total deterministic separated basic macro tree transducers. They also gave a procedure for deciding equivalence of transducer in the latter class. Here, we reconsider this equivalence problem. We present a new alternative decision procedure and prove that it runs in polynomial time. We also consider extensions of this result to partial transducers and to the case where parameters of transducers accumulate strings instead of trees.