Separability of rational subsets by recognizable subsets is decidable in $A^*\times\N^m$ - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Information Processing Letters Année : 2006

Separability of rational subsets by recognizable subsets is decidable in $A^*\times\N^m$

Résumé

Given a direct product of monoids $M=A^*\times \N^m$ where $A$ is finite and $\N$ is the additive monoid of nonnegative integers, the following problem is recursively decidable: given two rational subsests of $M$, does there exist a recognizable subset which includes one of the subsets and excludes the other.

Dates et versions

hal-00154387 , version 1 (13-06-2007)

Identifiants

Citer

Christian Choffrut, Serge Grigorieff. Separability of rational subsets by recognizable subsets is decidable in $A^*\times\N^m$. Information Processing Letters, 2006, 99 (1), pp.27-32. ⟨10.1016/j.ipl.2005.09.018⟩. ⟨hal-00154387⟩
20 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More