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

Authors:
Christian Choffrut;Flavio DAlessandro;Stefano Varricchio
Affiliations:
Laboratoire LIAFA, Université de Paris 7, 2, pl. Jussieu, 75251 Paris Cedex 05, France;Dipartimento di Matematica, Università di Roma La Sapienza, Piazzale Aldo Moro 2, 00185 Roma, Italy;Dipartimento di Matematica, Università di Roma Tor Vergata, via della Ricerca Scientifica, 00133 Roma, Italy
Venue:
Theoretical Computer Science
Year:
2007

Citing 7
Cited 0

Regularity and Related Problems for Deterministic Pushdown Automata

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

Automata, Languages, and Machines
Finiteness and Regularity in Semigroups and Formal Languages

Finiteness and Regularity in Semigroups and Formal Languages
The Mathematical Theory of Context-Free Languages

The Mathematical Theory of Context-Free Languages
Separability of rational relations in A* × Nm by recognizable relations is decidable

Information Processing Letters
On the structure of the counting function of sparse context-free languages

Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Quantified Score

Hi-index	5.23

Visualization

Abstract

This paper proves two results. (1) Given two bounded context-free languages, it is recursively decidable whether or not there exists a regular language which includes the first and is disjoint with the second and (2) given two rational k-ary bounded relations it is recursively decidable whether or not there exists a recognizable relation which includes the first and is disjoint with the second.