2015 | OriginalPaper | Buchkapitel
Rational Selecting Relations and Selectors
verfasst von : Luc Boasson, Olivier Carton
Erschienen in: Language and Automata Theory and Applications
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.