Separability of rational relations in A* × Nm by recognizable relations is decidable

Authors:
Christian Choffrut;Serge Grigorieff
Affiliations:
LIAFA, Université Paris, Paris Cedex, France;LIAFA, Université Paris, Paris Cedex, France
Venue:
Information Processing Letters
Year:
2006

Citing 4
Cited 1

Near optimal algorithms for computing Smith normal forms of integer matrices

ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Reversal-Bounded Multicounter Machines and Their Decision Problems

Journal of the ACM (JACM)
Automata, Languages, and Machines

Automata, Languages, and Machines
Modelization of deterministic rational relations

Theoretical Computer Science

Note: On the separability of sparse context-free languages and of bounded rational relations

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

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