Resynchronized Uniformization and Definability Problems for Rational Relations

被引：0
|
作者：
Loding, Christof [1 ]
Winter, Sarah [2 ]
机构：
[1] Rhein Westfal TH Aachen, Aachen, Germany
[2] Univ Libre Bruxelles, Brussels, Belgium
来源：
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE | 2023年 / 25卷 / 02期
关键词：
rational relations; transducer; synchronization languages; uniformization; definability; FINITE AUTOMATA;
D O I：
10.46298/DMTCS.7460
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
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.
引用
收藏
页数：35
相关论文
共 50 条
12345