Advertisement
Published in:
2015 | OriginalPaper | Chapter
Rational Selecting Relations and Selectors
Authors : Luc Boasson, Olivier Carton
Published in: Language and Automata Theory and Applications
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We consider rational relations made of pairs
$$(u,v)$$
of finite words such that
$$v$$
is a subword of
$$u$$
. We show that such a selecting relation can be realized by a transducer such that the output label of each transition is a subword of its input label. We also show that it is decidable whether a given relation has this property.