  An F-system is a computational model that performs a folding operation on
words of a given language, following directions coded on words of another given
language. This paper considers the case in which both given languages are
regular, and it shows that the class of languages generated by such F-systems
is a proper subset of the class of linear context-free languages.
