Christof Löding ; Sarah Winter - Resynchronized Uniformization and Definability Problems for Rational Relations

dmtcs:7460 - Discrete Mathematics & Theoretical Computer Science, September 6, 2023, vol. 25:2 -
Resynchronized Uniformization and Definability Problems for Rational RelationsArticle

Authors: Christof Löding ; Sarah Winter

    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.

    Volume: vol. 25:2
    Section: Automata, Logic and Semantics
    Published on: September 6, 2023
    Accepted on: May 18, 2023
    Submitted on: May 5, 2021
    Keywords: Computer Science - Formal Languages and Automata Theory

    Consultation statistics

    This page has been seen 425 times.
    This article's PDF has been downloaded 308 times.