Resynchronized Uniformization and Definability Problems for Rational Relations
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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2023-09-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/7460/pdf |
| _version_ | 1827063356188524544 |
|---|---|
| author | Christof Löding Sarah Winter |
| author_facet | Christof Löding Sarah Winter |
| author_sort | Christof Löding |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-25T01:56:53Z |
| format | Article |
| id | doaj.art-e0c80f9a18144c1fb1ed711bb278e58d |
| institution | Directory Open Access Journal |
| issn | 1365-8050 |
| language | English |
| last_indexed | 2025-02-18T20:44:09Z |
| publishDate | 2023-09-01 |
| publisher | Discrete Mathematics & Theoretical Computer Science |
| record_format | Article |
| series | Discrete Mathematics & Theoretical Computer Science |
| spelling | doaj.art-e0c80f9a18144c1fb1ed711bb278e58d2024-10-17T14:17:38ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1365-80502023-09-01vol. 25:2Automata, Logic and Semantics10.46298/dmtcs.74607460Resynchronized Uniformization and Definability Problems for Rational RelationsChristof LödingSarah WinterRegular 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.https://dmtcs.episciences.org/7460/pdfcomputer science - formal languages and automata theory |
| spellingShingle | Christof Löding Sarah Winter Resynchronized Uniformization and Definability Problems for Rational Relations Discrete Mathematics & Theoretical Computer Science computer science - formal languages and automata theory |
| title | Resynchronized Uniformization and Definability Problems for Rational Relations |
| title_full | Resynchronized Uniformization and Definability Problems for Rational Relations |
| title_fullStr | Resynchronized Uniformization and Definability Problems for Rational Relations |
| title_full_unstemmed | Resynchronized Uniformization and Definability Problems for Rational Relations |
| title_short | Resynchronized Uniformization and Definability Problems for Rational Relations |
| title_sort | resynchronized uniformization and definability problems for rational relations |
| topic | computer science - formal languages and automata theory |
| url | https://dmtcs.episciences.org/7460/pdf |
| work_keys_str_mv | AT christofloding resynchronizeduniformizationanddefinabilityproblemsforrationalrelations AT sarahwinter resynchronizeduniformizationanddefinabilityproblemsforrationalrelations |