A note on the class of languages generated by F-systems over regular languages
Formal Languages and Automata Theory
2022-05-23 v2
Abstract
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.
Cite
@article{arxiv.2007.15705,
title = {A note on the class of languages generated by F-systems over regular languages},
author = {Jorge C. Lucero and Sławek Staworko},
journal= {arXiv preprint arXiv:2007.15705},
year = {2022}
}
Comments
Nine pages. This is the accepted version of a manuscript submitted for publication in Information Processing Letters