A note on the class of languages generated by F-systems over regular languages

DOI10.1016/J.IPL.2022.106283OpenAlexW3046785554MaRDI QIDQ2094358

Sławek Staworko, Jorge C. Lucero

Publication date: 28 October 2022

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.15705

zbMATH Keywords

regular languageformal languagesfoldinglinear languageF-system

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• The Boolean closure of linear context-free languages
• On a family of linear grammars
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the class of languages generated by F-systems over regular languages