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

Angelo Monti and Peron Adriano: Logical definability of Y-tree and trellis systolic ω-languages. In: Acta cybernetica, (15) 1. pp. 75-100. (2001)

[thumbnail of cybernetica_015_numb_001_075-100.pdf]
Cikk, tanulmány, mű

Download (1MB) | Preview


In this paper we investigate the correspondence (in the style of the well known Büchi Theorem) between ω-languages accepted by systolic automata and suitable (proper) extensions of the Monadic Second Order theory of one successor (MSO[<]). To this purpose we extend Y-tree and trellis systolic automata to deal with ω-words and we study the expressiveness, closure and decidability properties of the two classes of ω-languages accepted by Y-tree and trellis automata, respectively. We define, then, two extensions of MSO[<], MSO[<,adj] and MSO[<,2x], which allow to express Y-tree ω-languages and trellis ω-languages, respectively.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2001
Volume: 15
Number: 1
ISSN: 0324-721X
Page Range: pp. 75-100
Language: English
Place of Publication: Szeged
Related URLs: http://acta.bibl.u-szeged.hu/38511/
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: p. 99-100. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2022. Jun. 14. 11:46
URI: http://acta.bibl.u-szeged.hu/id/eprint/12663

Actions (login required)

View Item View Item