Logical definability of Y-tree and trellis systolic ω-languages

被引：0

作者：

Angelo, M. ^{[1
]}

Adriano, P. ^{[1
]}

机构：

[1] Dipto. Scienze dell'Informazione, Univ. di Roma (La Sapienza), 00198, Via Salaria 113, Italy

来源：

Acta Cybernetica | 2001年 / 15卷 / 01期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

In this paper we investigate the correspondence (in the style of the well known Buchi Theorem) between ω-languages accepted by systolic automata and suitable (proper) extensions of the Monadic Second Order theory of one successor (MSO[

引用

页码：75 / 100