| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 436988 | Theoretical Computer Science | 2012 | 7 Pages |
Abstract
We consider the family of rational relations on words, i.e., relations recognized by multitape automata, which have rational trace on any finite intersection of rational relations. We prove that this family consists of finite unions of relations which are of two types: stars of tuples possibly with an extra prefix and suffix and relations with all but one singleton set components.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
