Resynchronized Uniformization and Definability Problems for Rational Relations
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2021
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909103539879936 |
|---|---|
| author | Löding, Christof Winter, Sarah |
| author_facet | Löding, Christof Winter, Sarah |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2104_12508 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Resynchronized Uniformization and Definability Problems for Rational Relations Löding, Christof Winter, Sarah Formal Languages and Automata Theory 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. |
| title | Resynchronized Uniformization and Definability Problems for Rational Relations |
| topic | Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2104.12508 |