有理关系的重同步一致化与可定义性问题
Resynchronized Uniformization and Definability Problems for Rational Relations
AI总结：
本文系统研究了基于正则同步语言定义的有理关系子类的一致化与可定义性问题的可判定性，重述已知结果并补充了若干新的可判定性与不可判定性结论。
摘要：
正则同步语言可用于定义有限词的有理关系，并刻画有理关系的子类，如自动或可识别关系。我们系统研究了基于此类同步语言定义的有理关系子类的一致化与可定义性问题的可判定性。我们重述了已知结果，并通过添加若干新的可判定性与不可判定性结果完善了全貌。
英文摘要：
Regular synchronization languages can be used to define rational relations of finite words, and to characterize subclasses of rational relations, like automatic or recognizable relations. We provide a systematic study of the decidability of uniformization and definability problems for subclasses of rational relations defined in terms of such synchronization languages. We rephrase known results in this setting and complete the picture by adding several new decidability and undecidability results.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
