Separating Automatic Relations - Archive ouverte HAL Access content directly
Conference Papers Year : 2023

Separating Automatic Relations

Abstract

We study the separability problem for automatic relations (i.e., relations on finite words definable by synchronous automata) in terms of recognizable relations (i.e., finite unions of products of regular languages). This problem takes as input two automatic relations R and R', and asks if there exists a recognizable relation S that contains R and does not intersect R'. We show this problem to be undecidable when the number of products allowed in the recognizable relation is fixed. In particular, checking if there exists a recognizable relation S with at most k products of regular languages that separates R from R' is undecidable, for each fixed k ≥ 2. Our proofs reveal tight connections, of independent interest, between the separability problem and the finite coloring problem for automatic graphs, where colors are regular languages.

Dates and versions

hal-04099907 , version 1 (17-05-2023)

Identifiers

Cite

Pablo Barceló, Diego Figueira, Rémi Morvan. Separating Automatic Relations. International Symposium on Mathematical Foundations of Computer Science (MFCS), Aug 2023, Bordeaux, France. ⟨hal-04099907⟩

Collections

CNRS ANR
48 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More