| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 436823 | Theoretical Computer Science | 2007 | 6 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
