DOI

By applying descriptive set theory we get several facts on the fine structure of regular ω-languages considered by K.Wagner. We present quite different, shorter proofs for main his results and get new results. Our description of the fine structure is new, very clear and automata-free. We prove also a closure property of the fine structure under Boolean operations. Our results demonstrate deep interconnections between descriptive set theory and theory of ω-languages.
Язык оригиналаанглийский
Название основной публикацииTAPSOFT '95: Theory and Practice of Software Development (CAAP 1995)
Страницы277-287
Число страниц11
DOI
СостояниеОпубликовано - 1 янв 1995
СобытиеTAPSOFT-1995 -
Продолжительность: 22 мая 1995 → …

Серия публикаций

НазваниеLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ИздательSpringer Nature
Том915
ISSN (печатное издание)0302-9743

конференция

конференцияTAPSOFT-1995
Период22/05/95 → …

ID: 127141657