Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. ,  investigate stronger variants of inclusion, equivalence and sequential uniformisation, based on a general notion of transducer resynchronisation, and show their decidability.  also investigate the classes of finite-valued rational transductions and deterministic rational transductions, which are known to have a decidable equivalence problem.  show that sequential uniformisation is also decidable for them.
['Emmanuel Filiot', 'Ismaël Robin Jecker', 'Christof Löding', 'Sarah Winter']
I am writing a research paper on a idea On Equivalence and Uniformisation Problems for Finite Transducers
[{"from": "human", "value": "I am writing a research paper on a idea On Equivalence and Uniformisation Problems for Finite Transducers"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. ,  investigate stronger variants of inclusion, equivalence and sequential uniformisation, based on a general notion of transducer resynchronisation, and show their decidability.  also investigate the classes of finite-valued rational transductions and deterministic rational transductions, which are known to have a decidable equivalence problem.  show that sequential uniformisation is also decidable for them."}]