Rational relations having a rational trace on each finite intersection of rational relations

Authors:
Christian Choffrut;Serge Grigorieff
Affiliations:
-;-
Venue:
Theoretical Computer Science
Year:
2012

Citing 3
Cited 0

Elements of Automata Theory

Elements of Automata Theory
Finite automata and their decision problems

IBM Journal of Research and Development
On relations defined by generalized finite automata

IBM Journal of Research and Development

Quantified Score

Hi-index	5.23

Visualization

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.