On ET0L Systems with Finite Tree-Rank

On ET0L Systems with Finite Tree-Rank
复制标题

具有有限树秩的 ET0L 系统

DOI:
--
复制
发表时间:
1981
期刊:
SIAM journal on computing (Print)
影响因子:
--
通讯作者:
D. Vermeir
D. Vermeir
中科院分区:
--
文献类型:
--
作者:
A. Ehrenfeucht;G. Rozenberg;D. Vermeir

文献摘要

被引文献

相似文献

本文研究了有限指标ETOL系统概念的一个推广。事实证明,通过对ETOL系统的裸派生树(即剥离标签的派生树)的集合设置一些非常自然的限制,可以表征有限秩的语言。研究了一类新的ETOL系统的性质,特别是它们与有限秩ETOL系统和有限指数ETOL系统的关系。
This paper studies an extension of the notion of a finite index ETOL system. It turns out that by setting some quite natural restrictions on the set of bare derivation trees of an ETOL system (that is derivation trees stripped of labels) one can characterize languages of finite rank. Several properties of the new class of ETOL systems are investigated; in particular their relationship to ETOL systems of finite rank and ETOL systems of finite index is investigated.