A note on the class of languages generated by F-systems over regular languages
Jorge C. Lucero, S{\l}awek Staworko
TL;DR
This paper investigates F-systems operating over regular languages, demonstrating that the languages they generate are a proper subset of linear context-free languages, thus clarifying their computational power.
Contribution
It characterizes the class of languages generated by F-systems over regular languages and establishes their position within the Chomsky hierarchy.
Findings
F-systems over regular languages generate a proper subset of linear context-free languages
The paper provides theoretical bounds on the computational power of F-systems
It clarifies the relationship between F-systems and other formal language classes
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.