当前位置: X-MOL 学术arXiv.cs.FL › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A note on the class of languages generated by F-systems over regular languages
arXiv - CS - Formal Languages and Automata Theory Pub Date : 2020-07-30 , DOI: arxiv-2007.15705
Jorge C. Lucero

An F-system is a computational model that performs a folding operation on strings of a given language, following directions coded on strings of another given language. This note considers the case in which both given languages are regular, and it shows that such F-system generates linear context-free languages. The demonstration is based on constructing a one-turn pushdown automaton for the generated language.

中文翻译:

关于 F 系统生成的语言类别而不是常规语言的说明

F 系统是一种计算模型,它按照在另一种给定语言的字符串上编码的方向对给定语言的字符串执行折叠操作。本笔记考虑了两种给定语言都是正则的情况,并表明这种 F 系统生成线性上下文无关语言。该演示基于为生成的语言构建单圈下推自动机。
更新日期:2020-08-03
down
wechat
bug