Skip to main content
Conference Proceedings

Rational selecting relations and selectors

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2015) 8977 716-726
DOI: 10.1007/978-3-319-15579-1_56
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Boasson, L., & Carton, O. (2015). Rational selecting relations and selectors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8977, pp. 716–726). Springer Verlag. https://doi.org/10.1007/978-3-319-15579-1_56

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free