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 条
  • [1] Generalized rational relations and their logical definability
    Choffrut, C
    Guerra, L
    FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS, 1997, 1279 : 138 - 149
  • [2] Some decisional problems on rational relations
    Madonia, M
    Varricchio, S
    THEORETICAL COMPUTER SCIENCE, 1997, 180 (1-2) : 1 - 15
  • [3] Uniformization of the leaves of a rational vector field
    Candel, A
    GomezMont, X
    ANNALES DE L INSTITUT FOURIER, 1995, 45 (04) : 1123 - &
  • [4] Lattice of Definability in the Order of Rational Numbers
    An. A. Muchnik
    A. L. Semenov
    Mathematical Notes, 2020, 108 : 94 - 107
  • [5] Lattice of Definability in the Order of Rational Numbers
    Muchnik, An. A.
    Semenov, A. L.
    MATHEMATICAL NOTES, 2020, 108 (1-2) : 94 - 107
  • [6] Stable definability and generic relations
    Kim, Byunghan
    Moosa, Rahim
    JOURNAL OF SYMBOLIC LOGIC, 2007, 72 (04) : 1163 - 1176
  • [7] Definability of Approximations in Reflexive Relations
    Syau, Yu-Ru
    Jia, Lixing
    Lin, En-Bing
    2013 IEEE INTERNATIONAL CONFERENCE ON GRANULAR COMPUTING (GRC), 2013, : 276 - 280
  • [8] Revisiting Membership Problems in Subclasses of Rational Relations
    Bergstraesser, Pascal
    Ganardi, Moses
    2023 38TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, LICS, 2023,
  • [9] ON DEFINABILITY OF RELATIONS BY ONLY ONE RELATION
    PAZDYKA, P
    ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1986, 32 (05): : 457 - 459
  • [10] LOGICAL DEFINABILITY OF SOME RATIONAL TRACE LANGUAGES
    CHOFFRUT, C
    GUERRA, L
    MATHEMATICAL SYSTEMS THEORY, 1995, 28 (05): : 397 - 420
12345